Consider the following array of 9 elements to be sorted using quicksort: [3, 1, 4, 6, 2, 5, 9, 7, 8] Quicksort chooses the pivot element uniformly at random from the list. The base case includes a call to a simple insertionSort routine whenever len(lst) <= 4 What is the probability that the chosen pivot results in the two parts having sizes <= 4? Enter answer correct to two decimal points. Answer What is the probability that after the partitioning, the resulting recursive calls are over sublists of sizes 2 and 6, respectively? Enter answer correct to two decimal points