Question $18$

Consider the following recursive function:

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

Which of the following statements is TRUE about the time complexity of this recursive function?

$T(n)$ is $(n^2**logn)$ and $T(n)$ is $(n^2)$

$T(n)$ is $(n^2**loglogn)$ and $T(n)$ is $(n^2**logn)$

$T(n)$ is $(n^2)$ and $T(n)$ is $(n^2{?}^{**}logn)$

$T(n)$ is $(n^2**logn)$ and $T(n)$ is $(n^2{?}^{**}loglogn).$