QUICKSORT is a famous and efcient algorithm to sort n distihd numbers (assume the numbers are 1' 2. 3, .., n) and it uses the RANDOM PARTITION procedure that operata in the followihg way: one oi 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 ihto another subset 6. Find the expected value and the vah'ance of the size of L