When the input array $($of size n$)$ is already sorted, what is the total number of key comparisons $($KCs$)$ made in one call to Hoare's partition using the first element as the pivot?

Question $11$ options:

n

$0$

n $+1$

n$/2$