Find the complexity of the following: A) f(n) = 5f(n/4) + 6n f(1) = 1, n = 4^k B) f(n) = 8f(n/2) + n^2 f(1) = 1, n = 2^k C) f(n) = 3f(n/3) + n^2 n = 3^k D) f(n) = 4f(n/2) + n^2 log n n = 2^k E) f(n) = f(n/4) + log n n = 4^k F) f(n) = 2f(n/4) + log n n = 4^k Suppose that the function of satisfies the recurrence relation f(n) = 2f(squarerootof n) + 1 whenever n is a perfect square greater than 1 and f(2) = 1 A) fing f(16) B) give a big-O estimate for (n)