The worst$-$case time of randomized quicksort is:

Group of answer choices

$\backslash$Theta $($n$)$

$\backslash$Theta $($n$^2)$

$\backslash$Theta $($nlog$($n$))$

$\backslash$Theta $($log$($n$))$