Question $1$

Consider the following divide$-$and$-$conquer algorithm.where pivots are selected such that the problem is divided into equally sized subproblems.

Which of the following recurrence relations best describes the time complexity of this algorithm?

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

$T(n)=3T(\frac{n}{3})+(n)$

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

$T(n)=3T(n-1)+(n^2)$