7. Write an algorithm to find sum of n numbers.

Read n numbers then check whether the number 17 within the numbers that 3 you have read. If it is not there then print "Not Found" else print "Found X Times".

Using recursion, write a function sum that takes a single argument n and computes the sum of all integers between 0 and n inclusive. Do not write this function using a while or for loop. Assume n is non-negative. def sum(n): """Using recursion, computes the sum of all integers between 1 and n, inclusive. Assume n is positive. >>> sum(1) 1 >>> sum(5) # 1 + 2 + 3+ 4+ 5 15 "*** YOUR CODE HERE ***"

#4. Euler's totient function, also known as phi-function ϕ(n),counts the number of integers between 1 and n inclusive,which are coprime to n.(Two numbers are coprime if their greatest common divisor (GCD) equals 1)."""def euler_totient(n):    """Euler's totient function or Phi function.    Time Complexity: O(sqrt(n))."""    result = n    for i in range(2, int(n ** 0.5) + 1):        if n % i == 0:            while n % i == 0:                n //= i.