[20, 62, 71, 85, 86, 61] Give me the number of comparisons and swaps for the above list, following insertion sort algorithm.

Sure, let's go through the insertion sort algorithm step by step for the given list [20, 62, 71, 85, 86, 61].

1. The list starts with [20, 62, 71, 85, 86, 61]. The first element, 20, is already sorted. So, no comparisons or swaps are needed here.

2. Next, consider the second element, 62. It's already in the correct position relative to 20. So, 1 comparison is made, but no swaps.

3. The third element is 71. It's also in the correct position relative to 20 and 62. So, 2 comparisons are made, but no swaps.

4. The fourth element is 85. It's in the correct position relative to 20, 62, and 71. So, 3 comparisons are made, but no swaps.

5. The fifth element is 86. It's in the correct position relative to 20, 62, 71, and 85. So, 4 comparisons are made, but no swaps.

6. The last element is 61. It's not in the correct position. It needs to be placed between 20 and 62. So, 5 comparisons are made, and 4 swaps are needed to put 61 in its correct position.

So, in total, there are 1 + 2 + 3 + 4 + 5 = 15 comparisons and 4 swaps.