An array always has to be sorted to perform a proper binary search O True O False Which sort routine has the same time complexity between Section Sort and Insertion Sort O Section Sort o Impossible to determine O Both are equal o Insertion Sort Given the following array of numbers, which sorting algorithm was used to sort it? { 6, 3, 7, 1, 4, 2 } Step 1: { 1, 3, 7, 6, 4, 2 } Step 2: { 1, 2, 7, 6, 4, 3} Step 3: { 1, 2, 3, 6, 4, 7 } Step 4: { 1, 2, 3, 4, 6, 7 } O Insertion Sort O Selection Sort Quick Sort O Merge Sort Bubble Sort A linear search has a time complexity of: O O(log n) n O O(n) O O(n^2) O O(2^n)