On the average, how many calls to the pseudo$-$random number generator does randomized quicksort do on an array of size n$?$

Group of answer choices

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

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

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

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