1. Suppose that instead of a randomized QuickSort we implement an indecisive QuickSort where the Partition function alternates between the best and the worst cases. You may assume that IndecisivePartition takes O(n) time on a list of length n (a) (5 pts) Prove the correctness of this version of QuickSort. (b) (5 pts) Give the recurrence relation for this version of QuickSort and solve for its asymptotic solution. Also, give some intuition (in English) about how the indecisive Partition algorithm changes the running time of QuickSort