1. (20 points) -) time if sorting involves points) Sorting n numbers takes ( comparisons between those numbers. (a) (2 (b) (2 points) True or false? Bubblesort is the best-performing sort ever (c) (2 points) True or false? It is possible to sort n numbers in (1) time. (d) (2 points) True or false? If a.equals(b) then in any correct implementation, a. hashCode() must equal b. hashCode. (e) (2 points) True or false? Merge sort is asymptotically faster than heapsort (f) (10 points) The recurrence for the worst-case time of binary search on an or array is whose solution by the master method is T(n) = ( Consider applying binary search to an ordered linked list. We find the middle element, and recursively ask for the solution in the sublist to the left or to the right of that middle element. The recurrence for worst-case time of binary search on an ordered linked list is T(n) = TG)+ 2 whose solution using the master method is How does this approach compare asymptotically with finding (or not finding) an element in an ordered list by starting at the head and examining each next clement in turn