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 $(\frac{1}{2})(n^2-n)$ and the number of item assignments is $(\frac{1}{2})(n^2+3n)-2.$