Question 3 (10 points) a. Using the master theorem, find which case [e.g. 1, 2 or 3] to be applied to solve the recurrence and also find the solution: I. II. III. T(n) = 4T(n/4) + n2 T(n) = T(3n/9) +n T(n) = 2T (n/4) + vn Hint of Master Theorem: 1. If f(n) = 0 (nlogo a-6) for some constant e > 0, then T(n) = (nlog) a). 2. If f(n) = O(nlogb a), then T(n) = O(nlogu algn). 3. If f(n) = N(nlog ate) for some constant e > 0, and if af scf(n) for some constant