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