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 make any comparison-based sorting algorithm stable. How much extra memory will your scheme need?