Write a program to test the performance of quick select algorithm (L12 slide 7-9) under different group size setting. In the slides, to find the pivot, the algorithm divide all elements into group of 5, find the median of each group and use the median of medians from all group as pivot