"Create a public non$-$final class called InsertionSorter. It should provide one public class method called sort. Sort should accept an array of Comparable Java objects and sort them in ascending order. However, it should sort the array in place, meaning that you modify the original array, and return the number of swaps required to sort the array. That$$s how we$$ll know you$$ve correctly implemented insertion sort. If the array is null or empty you should return $0.$ You can assume that the array does not contain any null values.

To receive credit implement insertion sort as described in class. Have the sorted part start at the beginning of the array and grow to the right. Each each step take the left$-$most value from the unsorted part of the array and move it leftward, swapping elements until it is in the right place. Note that you should not swap equal values. This will both make your sort unstable and cause you to fail the test. When you are finished the array should be sorted and you should return the count of swaps required.

As a reminder, first.compareTo$($second$)$ returns a positive value if first is larger t TD$12$ han second, a negative value if first is smaller than second, and $0$ if they are equal."