Use java.

Write an insertion sort code that counts the total comparisons and swaps and also it will print out the array every time when it swaps an element.

For example,

34	18	57	9	26	91	72
18	34	57	9	26	91	72
18	34	57	9	26	91	72
9	18	34	57	26	91	72
9	18	26	34	57	91	72
9	18	26	34	57	91	72
9	18	26	34	57	72	91

Numbers of comparisons: 13

Numbers of swaps: 7

Write a selection sort code that counts the total comparisons and swaps and also it will print out the array every time when it swaps an element.

For example,

34	18	57	9	26	91	72
9	18	57	34	26	91	72
9	18	57	34	26	91	72
9	18	26	34	57	91	72
9	18	26	34	57	91	72
9	18	26	34	57	91	72
9	18	26	34	57	72	91

Numbers of comparisons: 31

Numbers of swaps: 3