The recurrence relation for the worst$-$case time complexity of the quick sort algorithm corresponds to

Group of answer choices

T$($n$)=$T$($n$/2)+$O$(1)$

T$($n$)=$T$($n$-1)+$O$(1)$

T$($n$)=2$T$($n$/2)+$O$($n$)$

T$($n$)=$T$($n$-1)+$O$($n$2)$

T$($n$)=$T$($n$-1)+$O$($n$)$