A generic recursive algorithm has the following recurrence equation for its time complexity:

$T(n)=16T(\frac{n}{4})+n^2$

Which case of the Simplified Master Method does this fall in $($and what time complexity does it determine for the algorithm$)?$

Case $1$: Thus $T(n)=(n^2)$

Case $2$: Thus $T(n)=(n^{2}logn)$

The Simplified Master Theorem does not apply here.

Case $3$: Thus $T(n)=(n^2)$