Question$$

What is the time complexity of the quick sort algorithm in the best case $?$

a$.$ O$(1)$

b$.$ O$($log n$)$

c$.$ O$($nlog n$)$

d$.$ O$($n$^2)$

e$.$ O$($n$)$

Additionally, please give me time complexity of the quick sort algorithm Notes that will assist me in my upcoming examination.