A linear search has a time complexity of: O O(log n) n O O(n) O O(n^2) O O(2^n) A linear search is the best searching algorithm to use when an array is: O Not Sorted Sorted It's never better than a binary search The selection sort has a time complexity of: O O(n) o O(2^n) o O(n log n) O O(n^2) On2 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 O Selection Sort O Quick Sort Insertion Sort