)as we discussed in class, stable sorting algorithms maintain the relative order of records with equal values. that is, a sorting algorithm is stable if whenever there are two records r and s with the same key and with r appearing before s in the original list, r will appear before s in the sorted list as well. give a simple scheme to m