Code in Java please

Implemen nsertionSort. Compare their running times on sets of integers of size 10, 25, 50, and 100. Which appears to perform better as the number of integers increases? Why did you get the results you did? Make sure to run each algorithm at least 5 times on each set size (five times for set size of 10, five times for 25, etc. for EACH algorithm.) Hint Make use of the currentTimeMillis() method of System. E.g. t (or use built-in algorithms for) Quicksort, and I long startingTimeSystem.currentTimeMillis); long total = 0; //do something here: run an algorithm to test timing on long stoppingTime = System.currentTimeMillis(); long elapsed stoppingTime - startingTime; System.out.println (elapsed); This obtains the current time from the system at the beginning, then after the algorithm being tested is performed, get the stopping time. Then, find the difference, referred to as the elapsed time, and do something with it. Record in a table for this assignment