How do I do this ? I'm new at java.

8.6.3. Programming Challenge : Sort Runtimes Selection sort and Insertion sort have similar runtimes. They both have nested loops that run through the data of size n approximately n squared times. However, they perform differently on some data. In the Active code windows for Selection sort and Insertion sort above, add in a counter and increment it inside the inner loop to count the number of iterations. Add in print statements that will print the counter value after the loops. Run the code on the following data and record the runtimes in this Google document (do File/Make a Copy) also seen below. Test Case Selection Sort Runtime Insertion Sort Runtime Random order: (5,3,4,2,1) Reverse order: (5, 4, 3, 2, 1) Almost sorted: (1,2,3,5,4} Short Answer 8-6-11: Compare the runtimes of selection and insertion sort on the same data. There should be some data where one performed better than the other. Can you explain why this is? Trace through the code to figure out why. Discuss in pairs or groups. Using the space provided below, summarize the key discussion points and include a link to your Google document with the table of runtimes. Save Instructor's Feedback You have not answered this question yet. Activity: 8.6.3.1 shortanswer (challenge7-6-sorting)