L is a list is of length n and it is sorted using insertion sort.

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

2. Suppose that L is a list is of length n and it is sorted using insertion sort. If Lis already sorted, show that the number of comparisons is (n – 1) and thenumber of item assignments is 0.