Using the quicksort algorithm above. Present the first partitioning operation for the list 5 8 2 6 3 7 1 9 4, You should use the first number, 5, as a pivot for the partitioning. In your answer, you have to present the operation of the indexes i and j clearly.

ALGORITHM HoarePartition(A[l..r]) //Partitions a subarray by Hoare's algorithm, using the first element //Input: Subarray of array A[0.n - 1], defined by its left and right /Output: Partition of A[l..r], with the split position returned as p A[1] repeat as a pivot indices I and r (l