How many comparisons does the insertion sort use to sort the list 1, 2, 3, , n 2, n 1, n?

Count just the comparisons of the numbers in the list, specifically those made in the while loop condition.

Explain.