Suppose that we modify the partition algorithm in quicksort in such a way that on alternating levels of the recursion tree, partition either chooses the best possible pivot or the worst possible pivot. write down a recurrence relation for this version of quicksort and give its asymptotic solution. then, give a verbal explanation of how this partition algorithm changes the running time of quicksort.