Consider this partition () algorithm. = 9 1. pivot_index = 0, left = 1, right 2. while data [left] data[pivot_index] right-- 4. if left < right swap data[left] and data [right] 5. while right > left, go to 1 6. swap data[right] and data[pivot_index] 7. pivot_index = right Show the results of applying the partition algorithm to this array of numbers once (this is called one pass). That is, show the contents of the data array after executing the partition algorithm on this data. 10 20 14 3 92 800 6 22 19 4