Need to know how to do step 5 with step 4. Thanks in advance. Please provide screenshots of code and outputs.

4. Do some timing tests. Determine the growth rate of insertion sort for a range of values of N, and compare them to Collections.sort. Present a table of these times. Indicate the largest value for N that you could conveniently time on your computer using insertion sort 5. Create a new method that creates a new ArrayList of N consecutive (in-order) int values public static ArrayList createOrderedList(int n) 6. Repeat step 4 with these ordered lists