What is the worst$-$case run$-$time behavior of a simple quick sort algorithm when the pivot point is initially chosen to be the first element of the region and when does that behavior appear?

Question $8$ options:

It is O$($n$2)$ and it appears when the array is already sorted in increasing or decreasing order.

It is O$($logn$)$ and it appears when the array is already sorted in increasing order.

It is O$($n$)$ and it appears when the array is already sorted in increasing order.

It is O$($logn$)$ and it appears when the array is already sorted in decreasing order.