The number of inversions I(L) in a list L is the number of pairs of elements x, y such that x comes before y in L, but x > y. Recall that insertion sort adds the next element x at the back of the list, and swaps the element with the previous element until the previous element is smaller than x. Show that insertion sort runs in O(n+I(L)) time.