(3) If we change the randomized QUICKSORT algorithm so that it repeatedly ran- domly selects a pivot and runs PARTITION until it finds a good pivot like our SELECT does, and suppose we keep track of the pivots used so far so we never use one twice for the same array, what is the worst case cost of the algorithm? Give a recurrence for this and its asymptotic solution (you can use the master method.)