Trace the quicksort algorithm on the following array. Use the first item as the pivot (partition point) when doing a partition. 35, 6, 56, 43, 23, 19, 2 a) Show the series of item swaps that are performed in the partition process, and the array after each of these swaps, up to and including the step of placing the pivot at its correct location. You only need to show one partition (the partition of the original array). Enter your answer here
b) Show the full quicksort (recursion) tree, i. e. all partitions, on original array and all subarrays. Enter your answer here