solve all parts

Here is the pseudocode for quicksort except one line has been commented out. function quicksort (A,L,R) if L [3,2,1,4,6,7,5]. (a) If the resulting pivot index is always in the middle of the list, write down the recurrence relation for this code applied to a list of length n. Assume partition is O(n), which you can use in your answer. You can ignore all floors and ceilings. T(n) = (b) Suppose we run: quicksort ([8,4,3,1,2,6,7,5] ,0,7) What will the list look like at the end? Index hc tfals lala le 7 | Element (c) Suppose we apply this faulty version of quicksort to a list of unknown length and the resulting list is sorted. What must be true about the list immediately after rpi = partition(A,L,R) ends, every single time? Explain. Note: This seems open-ended but there is a very specific fact that must be true. Solution