Write a program that benchmarks MergeSort and SelectionSort.

You should use at least 5 different data sets containing random values, ranging in size from 10 elements to 100,000 elements.

Record the performance of each algorithm on the same sets under the same condition and write a short report that compares the two algorithms based on your results as comments at the end of your java file. It is important to include a discussion of the initial states of the data sets in your report.

This is in java programming language