Question $1$

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.

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.$

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.$

Question $2$

When the input array $($of size $n)$ is already sorted, which of the following is true about the total number of

swaps made in one call to the partition procedure of Quicksort?

Hoare's partition will make $(n)$ swaps while Lomuto's partition will make $(1)$ swaps.

Hoare's and Lomuto's partitions will both make $(1)$ swaps.

Hoare's and Lomuto's partitions will both make $(n)$ swaps.

Hoare's partition will make $(1)$ swaps while Lomuto's partition will make $(n)$ swaps.