Stable algorithms a. Explain the meaning of stability in a sorting algorithm. b. Explain a situation why stability in sorting is desired. c. State which algorithms are stable i. selection sort ii. bubble sort ii. insertion sort iii. merge sort iv. quick sort

Please justify your answer: Some sorting algorithms require extra space, apart from the space needed for the original  array that needs to be sorted. Which one of the following statements on the space usage of  sorting algorithms is correct?  a.)  A Heapsort for sorting an array of size N requires an amount of extra space proportional  to N.   b.)  Insertion Sort for sorting an array of size N requires an amount of extra space  proportional to N.   c.)  Merge sort for sorting an array of size N requires an amount of extra space proportional  to N.   d.) Quicksort for sorting an array of size N requires an amount of extra space proportional  to N.   e.) None of the above

How to solve this question

Pls. answer the 2 questions. write a short explanation each.