In Hoare’s partitioning during the quicksort algorithm, which of the following statements describes what happens to the pivot after partitioning?
a. The pivot is placed in its correct sorted position within the array.
b. The pivot remains in its original position in the array.
c. The pivot is always swapped with the middle element of the array, regardless of its relative order.
d. The pivot is always placed at the beginning of the array, regardless of its value.