7) (33 points) A sorting algorithm is called stable if the order of equal elements is d after sorting. Which of the following sorting algorithms are stable? If yes briefly justify it, and if no, give a counter example. (a) SELECTIONSORT (b) INSERTIONSORT
PayPal Gateway not configured
PayPal Gateway not configured