3. Suppose we use RANDOMIZED-SELECTION in Section 9.2 to select the maximum element of the array A= [3, 1, 2, 9, 0, 5, 4, 7, 6, 8]. (a) Describe one sequence of partitions that results in a worst-case performance of RANDOMIZED- SELECTION. [Note that there are many possible cases, you just have to find one.] (b) Describe one sequence of partitions that results in a best-case performance of RANDOMIZED- SELECTION. [Note that there are many possible cases, you just have to find one.] 3. Suppose we use RANDOMIZED-SELECTION in Section 9.2 to select the maximum element of the array A= [3, 1, 2, 9, 0, 5, 4, 7, 6, 8]. (a) Describe one sequence of partitions that results in a worst-case performance of RANDOMIZED- SELECTION. [Note that there are many possible cases, you just have to find one.] (b) Describe one sequence of partitions that results in a best-case performance of RANDOMIZED- SELECTION. [Note that there are many possible cases, you just have to find one.]