Java assignment

Consider the selection sort algorithm we saw in lecture. Suppose A=(12,4,20,6,2,11). Execute selection sort on A and write down what the list looks like after each iteration of the outer loop. How many comparisons were performed before the algorithm terminated?

Consider the insertion sort algorithm we saw in lecture. Suppose A=(12,4,20,6,2,11). Execute insertion sort on A and write down what the list looks like after each iteration of the outer loop. How many comparisons were performed before the algorithm terminated?