Time complexity of a certain recursive divide$-$and$-$conquer algorithm satisfies the recurrence relation$$ T$($n$)=9$T$($n$/3)+$n$2$T$($n$)=9$T$($n$/3)+$n$^2.$By the Master Theorem, T$($n$)$T$($n$)$is

Question $31$Answer

a$.$

$($n$^2)$

b$.$

None of the other choices

c$.$

$($n$^2$ logn$)$

d$.$

$($n$^3$ logn$)$

e$.$

$($n$^3)$