When all elements of the input array $($of size $n)$ are the same, which of the following

is true about Hoare's Quicksort algorithm?

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 $\frac{n}{2}.$

Hoare's Quicksort will repeatedly divide the input array into two subarrays, one

of size $0$ and the other of size $n.$