1. Using the Master theorem, which of the following best describes the run-time complexity of the recursively defined function T(n) = 3T(n/4) + 4n. A) Sublinear B) Linear C) Quadratic D) Exponential 1. Find a closed form for the recursively defined function T(n) = 2T(n-1) + 3, T(O) = 10. Writing your answer in the format: T(n) = A x 2" + B What are the values of A and B? A= B =