QUESTION 2 8 points Save Answer QUICKSORT is a famous and efficient algorithm to sort n distinct numbers (assume the numbers are 1, 2, 3, ..., n) and it uses the RANDOM PARTITION procedure that operates in the following way: one of the n numbers is selected at random (this number is called the pivot) and compared to all the other numbers. Those numbers smaller than the pivot are grouped into a subset L and those larger then the pivot are grouped into another subset G. Find the expected value and the variance of the size of L. For the toolbar, press ALT+F10 (PC) or ALT+FN+F10 (Mac). BIUS Paragraph Arial v 14px v x2 X2 -TT The ABC