in java Write a program to test the performance of quick select algorithm $($L$12$slide $7-9)$under different group size settings. The program should count the operations in under different group size settings.

Input to the program:

$1.$Size of each group in pivot selection $($at least $3,$odd number$)$

$2.$Number of elements in the sequence

$3.$k $($kth number looking for in the selection problem$)$

Output:

$1.$kth element's value

$2.$number of operations performed