$($b$)[3$ points$]$ What is the expected$-$case time complexity for the following algorithm?

MIN$(A,0,n-1)$

quickSort $(A,0,n-1)$

return $A[0].$