Write a Java program to implement insertion sort algorithm on an array of integers. Show each pass of sorting. Also count how many comparisons it was required to sort the array.

Sample Output: Enter how many numbers: 10 Input all integers: 20 19 25 29 13 40 47 32 41 50 Initial Array: 20 19 25 29 13 40 47 32 41 50 After Pass-1: 19 20 25 29 13 40 47 32 41 50 After Pass-2: 19 20 25 29 13 40 47 32 41 50 After Pass-3: 19 20 25 29 13 40 47 32 41 50 After Pass-4: 13 19 20 25 29 40 47 32 41 50 After Pass-5: 13 19 20 25 29 40 47 32 41 50 After Pass-6: 13 19 20 25 29 40 47 32 41 50 After Pass-7: 13 19 20 25 29 32 40 47 41 50 After Pass-8: 13 19 20 25 29 32 40 41 47 50 After Pass-9: 13 19 20 25 29 32 40 41 47 50 Total Comparisons: 1+1+1+4+1+1+3+2+1=15