Write java code for two Sort methods and compare the time taken to execute each Sort.
The code for both sort methods will be in the SAME java program (NOT two programs!).
Write Java code to populate an integer array with 100 Random integers in the range of 1 to 100 (both inclusive) using SecureRandom class.
Sort the above array using Selection Sort and output the sorted array as comma separated values.
Calculate and output the execution time for Selection Sort using the code below.
Sort the above array using Insertion Sort and output the sorted array as comma separated values.
Calculate and output the execution time for Insertion Sort using the code below.
----- Code for calculating execution time----
long start = System.nanoTime();------ your code here------long end = System.nanoTime();
long elapsedTime = end - start;
// 1 millisecond = 1,000,000 nano seconds
double elapsedMilliseconds= (double) elapsedTime / 1_000_000;
System.out.println(elapsedMilliseconds + " milliseconds");