8. A sorting algorithm is said to be stable if it does not exchange the relative positions of items with equal values. More formally, a sorting algorithm is stable if, for any two elements a and b with equal values, a precedes b after the sorting if and only if a precedes b before the sorting. Given this definition, is the insertion sort algorithm which was covered in class a stable sorting algorithm? Prove your answer. (5 pts.)