When the input array $($of size n$)$ is already sorted $($without duplicates$),$ which of the following is true about Hoare's Quicksort? Assume Hoare's partition always selects the array's first element as the pivot.

Question $13$ options:

Hoare's Quicksort will repeatedly divide the input array into two subarrays of arbitrary sizes.

Hoare's Quicksort will repeatedly divide the input array into two subarrays, one of size $1$ and the other of size n $-1.$

Hoare's Quicksort will repeatedly divide the input array into two subarrays, each of size n$/2.$

Hoare's Quicksort will repeatedly divide the input array into two subarrays, one of size $0$ and the other of size n$.$