Consider the following implementation of Randomized Ouick sort RANDOMIZED-PARTITIONA PO RANDOM, exchange Alrt with Al return PARTITIONA PO RANDOMIZED-OUICKSORTIA. P. pa 2 RANDOMIZED-PARTITIONA PO RANDOMIZED-GUICKSORTUA P. 4-2) RANDOMIZED-OUICKSORTIA G-21 Assume that p = Sandr = 10. what is the probability that Alp) and Alry will be compared with one another? Select one CU 1/4 What is the average case time complexity of randomized quicksort? Select one aflok) 001) c0) (alog) What is the probability that the rightmost element becomes the pivot in a single call of RANDOMIZED-PARTITION? Select one 41 P