we looked at the Quicksort algorithm. Consider the worst-case scenario for quick- sort in which the worst possible pivot is chosen (the smallest or largest value in the array). Answer the following questions: What is the probability of choosing one of the two worst pivots out of n items in the list? Extend your formula. What is the probability of choosing the one of the worst possible pivots for EVERY recursive call until reaching the base case. In other words, what is the probability quicksort fully sorts the list while choosing the worst pivot choice every time it attempts to do so? What is the limit of your formula above as the size of the list grows. Is the chance of getting Quicksort's worst-case improving, staying constant, or converging on some other value. Present one sentence on what this means. What are the chances that we actually get Quicksort's worst-case behavior?