Recursionhard
0:00.0

For the recurrence T(n)=2T(n/2)+n2T(n) = 2T(n/2) + n^2, identify the correct case of the Master Theorem.