1. Refer to the array A shown in Figure I for subsequent computations. You may replace the letters with the corresponding numbers, e.g., A=1, Z=26 to solve this question. However, you must present your solutions by drawing the step-by-step computations of the sorting algorithms using the letters. T NQL M | z | Y | X Figure 1 a) Show and explain clearly what array A in Figure 1 looks like in each step of the partition algorithm. b) Continuing from your answer in part (e), show each step in the quicksort algorithm when applied to the above array A.