data stracture with clear steps plz

Suppose that L is a list is of length n and it is sorted using insertion sort. If L is already sorted in the reverse order, show that the number of comparisons is (1/2)(n2 - n) and the number of item assignments is (1/2)(n2 +3n) - 2