Multiple Choice points possible (graded) Suppose that we used the randomized selection algorithm to find the minimum element, with the modification that if we chose the maximum number as our partition element, we put that number into the set H. Suppose that our input was (5, 8, 1, 3, 4, 2, 6, 7). Which sequence of partition elements would result in the largest running time? 8,7,6,5, 4,3,2, 5,8,1,3,4, 2,6,7 7,6,2,4, 3, 1, 8,5 Suppose that, in quicksort, we were very unlucky, and chose the worst possible partition element at each step. What would the running time of the algorithm be? () n log n Suppose that you pick a random integer between 1 and 100 (inclusive). What is the probability that your number is somewhere between 33 and 672 1/3 2/3