Consider the quicksort algorithm covered in the class. 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.