Ononot — What is the asymptotic complexity O(n^k) of the recurrence T

Guest Session: 1 Question Remaining. Create Account to save progress.

Recursionmedium

0:00.0

What is the asymptotic complexity $O(n^k)$ of the recurrence $T(n) = 4T(\frac{n}{2}) + n^2$ using the Master Theorem?