Q.1. (50 Points) Sort A = [ 13, 6, 30, 1, 5, 9, 12, 6, 5, 3, 5, 17] 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. Please strictly follow the steps of the partitioning and quick sort algorithm.

Q.2. (50 Points) Sort array A = [ 13, 6, 30, 1, 5, 9, 12, 6, 5, 3, 5,17] using merge sort and illustrate your recursion calls it is shown in your lecture notes (sorting.pdf)

Q.3. (10 Bonus Points) Sort the array A = [ 3, 1, 4, 1, 5, 9, 2, 6, 5] using insertion sort and illustrate your solution it is shown in your lecture notes (sorting.pdf)