Q.1. (50 Points) Sort A = [10, 4, 0, 21, 12, 1, 7, 18, 6, 45] using quicksort with median-of-three partitioning (Figure 7.16 from your textbook) and a cutoff of 3. For this question, you need to illustrate the step by step solution of the quick sort algorithm as illustrated in your textbook Fig 7.14. Also, please check the video notes for quick sort. Please strictly follow the steps of the partitioning and quick sort algorithm, Otherwise you will lose some credits on your solution