The Insertion Sort uses an incremental approach. It works similar to the way you might organize a hand of cards. The unsorted cards begin face down on the table and are picked up one by one. As cach new unsorted card is picked up, it is inserted into the correct order in your organized hand of cards. 4 3 4 3 The following shows the sequence of steps in an Insertion Sort: 2 5 14 3 Original data. The 2 is our "hand" so insert the 5 into it. 251 End of I" pass: The 5 is already in the right place. No need to move. 2 5 1 Our "hand" is now 2,5. Think of inserting the I into it. 1 2 5 4 3 End of 2 pass: Notice the 1 has been inserted in the right place. 1 2 5 4 3 Our "hand" is now 1, 2, 5. Think of inserting the 4 into it. 1 2 4 5 3 End of 3' pass: Notice the 4 has been inserted in the right place. 2 53 Our "hand" is now 1, 2, 4.5. Think of inserting the 3 into it. 1 2 3 4 5 End of 4th pass: Notice the 3 has been inserted in the right place. public static void sort(int a[]) //This will do an ascending sort int itemTonsert, boolean keepGoing: 1/On kth pass, insert item k into its correct position among the first k items in the array for(int klik