$2$

$2$ points

Which of the following represents the time complexity $($worst case$)$ of the following pseudocode if we choose as a initial pivot the largest element in the array for the sorting function:O$($n$^(2))$O$($n log n$)$O$($log n$)$O$($n$^(2)$log n$)$