2. Quicksort (a) Illustrate the performance of quicksort step by step on the array A = {9,1,5,7,8,10,3,4}. Clearly indicate the contents of the array A after each call to partition, the pivots, and which elements are already in the final sorted position at each step. (b) What is the recursion that characterizes the running time of randomized quicksort? Justify your answer. () What are the worst-case and expected running times of randomized quicksort