The worst$-$case performance of quick sort for n items is

Group of answer choices

O$($n$)$

O$($n logn$)$

O$($n$^2)-$ n raised to the power $2$

O$($log n$)$