When an array is to be sorted, It may happen that some data values start out being in the same position where they should end up. For example in the array which is originally {40, -1, 33, 0} 33 is right where it will be in the final sorted output: {-1, 0, 33, 40} But as a particular sorting algorithm operates, it might (depending on the algorithm) move such an element out of the position where it belongs (of course, it will eventually get moved back) which of the following statements are true:
i. Merge Sort never (even temporarily) moves such an element
ii. Quick Sort never (even temporarily) moves such an element
iii. Selection Sort never (even temporarily) moves such an element
(a) ii only (b) i & iii (c) i & ii (d) ii & iii