Which sort routine has the same time complexity between Merge Sort and Quick Sort O Quick Sort O Impossible to determine Both are equal O Merge Sort Which sort routine has the same time complexity between Insertion Sort and Merge Sort Both are equal O Insertion Sort O Merge Sort o Impossible to determine Given the following array of numbers, which sorting algorithm was used to sort it? { 6, 3, 7, 1, 4, 2 } Step 1: { 1, 2, 6, 3, 7, 4 } Step 2: { 1, 2, 3, 4, 6, 7 } O Merge Sort Insertion Sort O Selection Sort O Quick Sort O This is not a sort routine Given the following code, what will be printed 11 HashMap stuff = new HashMap(); System.out.print(stuff.put(1, "Bill") + "); System.out.print(stuff.put(2, "Sally") + "); System.out.print(stuff.put(1, "Sally") + "); System.out.print(stuff.put(2, "Bill")); O null, null, null, null O null, null, Sally, Bill O Bill, Sally, Sally, Bill o null, null, Bill, Sally