Which sort routine has the same time complexity between Selection Sort and Merge Sort o Impossible to determine O Merge Sort O Selection Sort O Both are equal The selection sort has a time complexity of: O O(n) O 0(2^n) O O(n log n) O O(n^2) A linear search is the best searching algorithm to use when an array is: O Not Sorted O Sorted It's never better than a binary search Given the following array of numbers, which sorting algorithm was used to sort it? { 6, 3, 7, 1, 4, 2 } Step 1: { 3, 6, 7, 1, 4, 2 } Step 2: { 1, 3, 6, 7, 4, 2 } Step 3: { 1, 3, 4, 6, 7, 2 } Step 4: { 1, 2, 3, 4, 6, 7 } Bubble Sort O Merge Sort Selection Sort O Quick Sort O Insertion Sort