iam in exam help

Time left 1:09:49 The solution to the following recurrence T(n) = 4T(n/2) + n^2 using the master theorem is Select one: a. Master theorem can't be applied b. O((n.log n) O C. (n^2. log_7 (n^3 )) O d. O(n^2.log n) cronario for the Randomized Quick Sort algorithm is much more common that