Given $T(1) = 1$ and $T(n) = 4T(n/2) +n^2$ for $n\geq 2$, can I solve the recurrence for $T$ by applying the master theorem with $a = 4$, $b = d = 2$?This would give $T(n) = \Theta(n^2\log n)$.
Does master theorem apply differently for $n$ with restrictions?
recurrence relation;master theorem