Java: For the following arrays, write out the steps that Insertion sort takes to sort the array from least to greatest (or earliest in alphabet to latest). As on the board in class, clearly indicate in some way which element is the "ith" element in each row and add a new row each time that you swap elements. At the end, state the number of comparisons and swaps that you had to do to sort the array.

1. 5 1 8 3 9 2
2. 9 8 7 3 8 7 1
3. h a p p y f e e t