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