Please help me answer this question i need this in $30$ mintes, Show that T$($n$)=$log$1+$log$2+$log$3+$cdots$+$logn$=$theta $($nlogn$),$ for n$>1$

Hint: To show T$($n$)=$theta $($nlogn$),$ you need to show both T$($n$)=$O$($logn$)$ and T$($n$)=$ T$($n$)=$Omega $($nlogn$)$ directly. You may consider using mathematical induction to prove it$.$ Or you could directly utilize the Stirling's formula to prove that T$($n$)=$Theta $($nlogn$)$