Solve the following exercises in Sorting Algorithms: a. Recall that a sorting algorithm is said to be stable if the original ordering for duplicate keys is preserved. Of the sorting algorithms...

Extracted text: Solve the following exercises in Sorting Algorithms: a. Recall that a sorting algorithm is said to be stable if the original ordering for duplicate keys is preserved. Of the sorting algorithms Insertion Sort, Bubble Sort, Selection Sort, Shell sort, Merge sort, Quicksort, Heapsort, Binsort, and Radix Sort, which of these are stable, and which are not? For each one, describe either why it is or is not stable. If a minor change to the implementation would make it stable, describe the change. b. Which of the following operations are best implemented by first sorting the list of numbers? For each operation, briefly describe an algorithm to implement it, and state the algorithm's asymptotic complexity. i. ii. iii. Find the minimum value. Find the maximum value. Compute the arithmetic mean. iv. Find the median (i.e., the middle value). Find the mode (i.e., the value that appears the most times). V.