Question 1 1 pts For large arrays, the insertion sort is prohibitively inefficient. O True O False Question 2 1 pts The merge sort is a recursive algorithm. O True O False Question 3 1 pts Given the fact that a selection sort of n items requires n2/2+5 n/2 3 major operations, the selection sort is O Oin2) O o(1) O Oin) O O(log2 n)