Consider the following array:

A = [8,1,6,9,10,4,7,5,3,2]

We wish to find the 9th order statistic (the element that would be at the 8th index in a sorted array using 0-indexing). 

We use the QuickSelect algorithm along with Hoare's algorithm for in-place partitioning. The chosen pivot is always the first element of the subarray. 

As the partitioning algorithm is in place, swaps made in the partitioning algorithm will be reflected permanently in the array. 

Consider the state of the array after 2 rounds of partitioning or alternatively, if the 9th order statistic is found earlier, consider the state of the array at that point. 

Select all statements that are TRUE. The array is 0-indexed.