Consider the recurrence $T(n)=aT(\frac{n}{b})+n^2$

Which $2$ expressions of $k$ used for a and $b,$ respectively, would give this algorithm a $$ complexity of $n^3?$

Assume k $>1$

$k+3,k-3$

$k^4,k$

$8k^2,2k$

$k^2,k$