Show the step-by-step process of the quicksort algorithm when the input sequence is [ 8, 9, 7, 2, 5, 4, 1, 3, 6, 4 ]. You should show the exchanges of elements, the pivots, and the modifications of the sequence. Pick the last element as the pivot always. (Note: use quicksort recursively. You do not need to show merge steps.)