Kindly help check for correction in the attached. Benchmarking Sorting AlgorithmsThe same task can take vastly different amounts of time, depending on the algorithm that is used to perform the task. You are familiar with simple sorting algorithms such as insertion sort and selection sort. While these methods work fine for small arrays, for larger arrays they can take an unreasonable amount of time. The question is whether we can do any better.Java has some built-in sorting methods. They can be found in the class named Arrays in the package java.util. The one that you will use in this lab is Arrays.sort(A), which sorts the entire array A into increasing order. (Actually, there are different methods for different array base types, but all the methods have the same name and are used in the same way. You will be using an array of ints in this lab.)You should write a program that does the following:Create two arrays of type int[]. Both arrays should be the same size, and the size should be given by a constant in the program so that you can change it easily.Fill the arrays with random integers. The arrays should have identical contents, with the same random numbers in both arrays. To generate random integers with a wide range of sizes, you could use (int)(Integer.MAX_VALUE * Math.random()).Sort the first array using either Selection Sort or Insertion Sort. You should add the sorting method to your program; you can copy it from (http://math.hws.edu/javanotes/ ; Section 7.4) if you want. (It is a good idea to check that you got the sorting method correct by using it to sort a short array and printing out the result.)Time how long it takes to sort the array and print out the time.Now, sort the second (identical) array using Arrays.sort(). Again, time how long it takes, and print out the time.You should run your program using array sizes of 1,000, 10,000, and 100,000. Record the sort times. Add a comment to the top of the program that reports the times. (You might be interested in applying Arrays.sort() to a million-element array, but don't try that with Selection Sort or Insertion Sort!)Note: The general method for getting the run time of a code segment is:long startTime = System.currentTimeMillis();doSomething();long runTime = System.currentTimeMillis() - startTime;This gives the run time in milliseconds. If you want the time in seconds, you can use runTime/1000.0. E eclipse-workspace - Lab1/src/BenchmarkingSortingAlgorithms.java - Eclipse IDEFile Edit Source Refactor Navigate Search Project Run Window Help台▼圖E Package Explorer 3 E Project ExplorerD MathQuizjavaD TextlO.javaD AdditionProblem.javaA BenchmarkingSortingAlgorithms.java XE Outline XvS Lab1EA JRE System Library [JavaSE-15]System.out.println("Arrays Sort time(sec):"+runTimeArray2/1000.0); // Print result}279 BenchmarkingSortingAlgorithmsA maxArraySize : intsortingArray1: int[)A sortingArray2 : int[]° BenchmarkingSortingAlgorithmsAS selectionSort(int[]) : void28vA src2930v E (default package)> D AdditionProblem.java> D BenchmarkingSortingAlgorithms.java> D MathQuiz.java> D Textl0.javaA310static void selectionSort(int[] A) {// Sort A in increasing order, using selection sortfor (int lastPlace = A.lengthfi-1; lastPlace > 0; lastPlace fifi)) k // Find t// A[lastPlace], and move it into position lastPlace// by swapping it with the number that is currently// in position lastPlace.int maxLoc = 0; // Location of largest item seen so far.for (int j = 1; j <= lastPlace; j++) {if (A[j] > A[maxLoc]) {// Since A[il is bigger than the maximum we have seen// so far, i is the new location of the maximum value// we have seen so far.maxLoc = j;}}int temp = A[maxLoc]; // Swap largest item with A[lastPlace].A[maxLoc] = A[1lastPlace];A[lastPlace] = temp;E // end of for loop32333435363738394041424344454647484950%3D}5152}5354A Problems @ Javadoc e Declaration e Console 3關AdditionProblem [Java Application] C:\Users\user\.p2\pool\plugins\org.eclipse.justj.openjdk.hotspot.jre.full.win32.x86_64_15.0.2.v20210201-0955\jre\bin\javaw.exe (Jun 23, 2021, 9:37:46The sum of : 34 + 13Please enter your answerWritableSmart Insert33: 84: 1729 E eclipse-workspace - Lab1/src/BenchmarkingSortingAlgorithms.java - Eclipse IDEFile Edit Source Refactor Navigate Search Project Run Window Help- O - Q ▼国 T , ▼やE Package Explorer X E Project ExplorerD MathQuizjavaD TextlO.javaD AdditionProblem.javaD BenchmarkingSortingAlgorithms.java 8E Outline 8v Lab1> A JRE System Library [JavaSE-15]v 9 BenchmarkingSortingAlgorithmsv srcv E (default package)> D AdditionProblem.java> D BenchmarkingSortingAlgorithms.java> D MathQuiz.java> D Textl0.javaimport java.util.*;public class BenchmarkingSortingAlgorithms {// Compute benchmarks of two different sorting techniquesint maxArraysize=10000; // Array Sizeint[] sortingArray1 = new int[maxArraySize]; // First Arrayint[] sortingArray2 = new int[maxArraysize]; // Second ArraymaxArraySize : intsortingArray1: int[]A sortingArray2 : int[]C BenchmarkingSortingAlgorithmsselectionSort(int[]) : void6.89.public BenchmarkingSortingAlgorithms (){// Class Constructorfor (int i = 0; i < sortingArray1.length; i++) {// Filling two arrays with the same random numbers.sortingArray1[i]=(int) (Integer.MAX_VALUE * Math.random());sortingArray2[i]=sortingArray1[i];100111213141516long startTimeArray1 = System.currentTimeMillis();// Start computing time for SelectionSortselectionSort(sortingArray1); // Sorting Array1 with SelectionSortlong runTimeArray1 = System.currentTimeMillis() - startTimeArray1; //Time to run t17181920long startTimeArrav2 = System.currentTimeMillis();// Start computing time for ArraArrays.sort(sortingArray2); // Sorting Array2 with Arrays.sortlong runTimeArray2 = System.currentTimeMillis(); // Time to run the Arrays.sortSystem.out.println("SelectionSort time(sec):"+runTimeArray1/1000.0); // Print resuSystem.out.println("Arrays Sort time(sec):"+runTimeArray2/1000.0); // Print resultA Problems @ Javadoc e Declaration e Console 3AdditionProblem [Java Application] C:\Users\user\.p2\pool\plugins\org.eclipse.justj.openjdk.hotspot.jre.full.win32.x86_64_15.0.2.v20210201-0955\jre\bin\javaw.exe (Jun 23, 2021, 9:37:46The sum of : 34 + 13Please enter your answerWritableSmart Insert33: 84: 1729

PROGRAM CODE: import java.util.Arrays; import java.util.Scanner; public class Main { public static…

Kindly help check for correction in the attached. Benchmarking Sorting Algorithms The same task can take vastly different amounts of time, depending on the algorithm that is used to perform the task. You are familiar with simple sorting algorithms such as insertion sort and selection sort. While these methods work fine for small arrays, for larger arrays they can take an unreasonable amount of time. The question is whether we can do any better. Java has some built-in sorting methods. They can be found in the class named Arrays in the package java.util. The one that you will use in this lab is Arrays.sort(A), which sorts the entire array A into increasing order. (Actually, there are different methods for different array base types, but all the methods have the same name and are used in the same way. You will be using an array of ints in this lab.) You should write a program that does the following: Create two arrays of type int[]. Both arrays should be the same size, and the size should be given by a constant in the program so that you can change it easily. Fill the arrays with random integers. The arrays should have identical contents, with the same random numbers in both arrays. To generate random integers with a wide range of sizes, you could use (int)(Integer.MAX_VALUE * Math.random()). Sort the first array using either Selection Sort or Insertion Sort. You should add the sorting method to your program; you can copy it from (http://math.hws.edu/javanotes/ ; Section 7.4) if you want. (It is a good idea to check that you got the sorting method correct by using it to sort a short array and printing out the result.) Time how long it takes to sort the array and print out the time. Now, sort the second (identical) array using Arrays.sort(). Again, time how long it takes, and print out the time. You should run your program using array sizes of 1,000, 10,000, and 100,000. Record the sort times. Add a comment to the top of the program that reports the times. (You might be interested in applying Arrays.sort() to a million-element array, but don't try that with Selection Sort or Insertion Sort!) Note: The general method for getting the run time of a code segment is: long startTime = System.currentTimeMillis(); doSomething(); long runTime = System.currentTimeMillis() - startTime; This gives the run time in milliseconds. If you want the time in seconds, you can use runTime/1000.0.