Section IV. Sorting and Selection 1) Answer the following questions about QuickSort a. What are two worst-case inputs for the version which partitions around the last element in each (sub)array (2 points)? b. Briefly explain why these inputs maximize theruntimee fav 1 ver[A fv' LVE out, atins to- tte-,er+ the worst case? (2 points)? whenearvey con tte p.vot vice c. Under which condition d oes Quicksort achieve (n log n) runtime even in mant d. Name an algorithm that can be used to ensure this condition is met and the (n log n) runtime is achieved e. Explain why this approach is not used in practice despite the theoretical improvement