The recurrence $T(n) = 4T(n/2) + n^2$ describes the runtime of an algorithm. Using the Master Theorem with $a=4, b=2, f(n)=n^2$, what is $\Theta(T(n))$?