Use the Master Theorem, if possible, to solve the recurrence T(n) = 64T (n/4) + n^2 By case 2: T(n) = Theta (n^3 log n) Master Theorem does not apply By case 1: T(n) = Theta (n^3) By case 3: T(n) = Theta (n^2) Use the Master Theorem, if possible, to solve the recurrence T(n) = 4T (n/16) + 4 log n. By case 2: T(n) = Theta (squareroot n log n) Master Theorem does not apply By case 1: T(n) = Theta (squareroot n) By case 3: T(n) = Theta (log n)