2) Which of the following could be the first iteration of a selection sort?:* A) It splits the array in several different but equal pieces. OB) It finds the largest element in the list and moves it to the highest index. C) It finds the largest and smallest elements in the list and creates a new array with those two elements in sorted position. D) It moves the largest and smallest elements into their final positions. E) It orders the first two elements of the list. 3) What advantage does a merge sort have over an insertion sort?:* A) It is more memory-efficient on arrays. B) It works on linked lists while insertion sort does not C) It is more efficient from a runtime perspective. D) It can handle all data types. E) There is no advantage of using a merge sort