1. Consider the following algorithm, which is exactly the same algorithm we considered in the class for the Selection problem with one difference; Instead of dividing the input into groups of 5 elements, we divide the input into groups of k elements, where k is a parameter of the algorithm WCL Select (A, first, last, i, k) if (first last) return Alfirst; i 1 in this case Divide n elements into groups of k elements; //g1 g2... gnyk Find the median mi each group gi; Use WCL Select to find the median m of the medians of all the groups mid NewPartition(A, first, last, mn);//it partitions around mm mid and less mid first 1; if (mid and less 10 we may be lucky return Almidl; if (i mid and less it is in the left subarray return (WCL Select(A, first, mid-1, i, k)); return (WCL Select(A, mid +1, last, i-midandless, k))