Analysis of algorithm

This problem has to do with the choice of a pivot in quicksort. Describe the property that the pivot must satisfy in order for quicksort to have its best-case running time. Explain how the order statistics algorithm described in class can be used to generate a good pivot. What is the worst-case running time of this algorithm? What is the expected running time of this algorithm