I need help with this in java please!!

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

Experiments:

Use the program you write to collect the performance of group size $=3,5,7$ under different input sizes and plot them in one chart. Present your collected data and plot chart$($s$)$ in your report.

Analysis:

In your report, you need address following items based on your implementation and experiment data:

Discuss the worst case growth rate performance for group size $3,5,7$ you expect based on your understanding of the algorithm

Explain the growth rate show up on your plot and collected data

Does your experiment data results match with your worst case performance expectation?

If yes, compare the expected growth rate and your data's grow rate to justify your claim if no$,$ discuss why and what you plan to adjust in your experiments to get worst case performance

Submission:

Source codes

Report $($with experiment data, plot diagram, analysis$)$