Let f(n)=121+222++(n1)2 n1+n2n. Find g(n) so that f(n) is (g(n)). Justify your answer by presenting clear arguments for the O and bounds. (4) Given a positive integer n that is a perfect squre (i.e. its square root is an integer: for example, n=25 ), present an algorithm to output square root of n. Your algorithm needs to run in O(logn) time. Obviously, you cannot invoke any predefined function to compute the square root. Hint: You want to search for n in 122(n1)n. The following is the pseudo-code I will write for the problem of finding the number of even integers in A[p] through A[r]. You may use this as guideline. Number-of-Even (A, p,r)f count = 0 ; 1/ scan the entries and find how many are even for i=p to r if (A[i] is even) count = count +1;// or, count++; return count