CS 3330 Assignment 2 (Due: at 11:59PM on 4/2/2018) Q.1. (50 Points) Sort A [ 13, 6, 30, 1, 5, 9, 12, 6, 5, 3, 5, 171 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