A stable sorting algorithm is one that does not reorder identical elements when sorting. For example, consider the list A1 B A2 C A3, where A1, A2, A3 are identical values in the order specified by the subscripts. A stable sorting algorithm would always produce a sorted list A1 A2 A3 B C (rather than A3 A1 A2 B C, for example). Consider the sorting algorithms Selection Sort and MergeSort. Which, if any, are stable sorting algorithms?

Consider the algorithms as stated in the book.(Consider the comparisons done to reorder the elements.)

Please explains all subquestions in detail answer.