Consider the following randomized variant of selection, which selects the k th smallest element in an unsorted array a[1. . n]. also assume that the array elements have distinct values. recall thep partition(a[1. . n], p) function, which partitions an array into three parts by com-paring the pivot element a[p] to every other elements, using (n−1) comparisons, and returns thenew index of the pivot element