show the working of insertion sort on the array {1, 3, 5, 6, 4, 2, 7, 9, 8, 0}. You need to indicate which elements of the array are compared and/or moved after each iteration of the main loop in the insertion sort algorithm.

10 11 12 13 14 15 16 0 11 12 13 14 15 16 14 15 16 17 A2 2 34 A2 A 2 2 A1 2 2 3 4 2 3 6 3 16 00