We looked at an algorithm to find the k$-$th smallest number in an array. How much time does that algorithm take if the array has n members?

Group of answer choices

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

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

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

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