Q32MCQ2 marks, −0.67Consider the following recurrence relation: T(n)={nT(n)+n for n≥1,1 for n=1T(n)=\left\{\begin{array}{c}\sqrt{n} T(\sqrt{n})+n \text { for } n \geq 1, \\ 1 \quad \text { for } n=1\end{array}\right.T(n)={nT(n)+n for n≥1,1 for n=1 Which one of the following options is CORRECT?(A)T(n)=Θ(nloglogn)T(n)=\Theta(n \log \log n)T(n)=Θ(nloglogn)(B)T(n)=Θ(nlogn)T(n)=\Theta(n \log n)T(n)=Θ(nlogn)(C)T(n)=Θ(n2logn)T(n)=\Theta\left(n^2 \log n\right)T(n)=Θ(n2logn)(D)T(n)=Θ(n2loglogn)T(n)=\Theta\left(n^2 \log \log n\right)T(n)=Θ(n2loglogn)Sign in to save attempts.Show answer← PreviousNext →SolutionsDiscussionLoading…Sign in with Google