(B) False, False
A Sorting algorithm is said to be stable if two objects with equal keys appear in the same order in sorted output as they appear in the input array to be sorted.
Quick Sort and Selection Sort are not stable because it swaps non-adjacent elements.
Example: Given [2, 2, 1], the '2' values will not retain their initial order.