13. Suppose that function f(n) satisfies recurrence f(n) = 16f(n/2) + n whenever integer n 2 is a power of 2. Give a closed form solution for f(n) that holds to within a constant factor. (That is, find an expression E involving n so that f(n) is (E).) 2 14. Suppose that function f(n) satisfies recurrence f(n) 16f(n/2) +n = whenever integer n 2 is a power of 2. Give a closed form solution for f(n) that holds to within a constant factor. (That is, find an expression E involving n so that f(n) is (E).)