1. Consider the sorted list (5, 8, 10, 13, 15, 19 25, 34, 40, 41), with low index = 0 and high index = 9. Which index and element from this list does Binary Search selects to start the search? (index, element) = (4, 15) (index, element)=(5, 19) (index, element)=(5, 15) (index, element)= (4, 13) 2. Consider the list: (10, 6, 3, 8, 2, 7, 15, 17, 13, 19). One of the interleaved sublists considered by the Shell sort algorithm with gap value of 3 is 10, 8, 15, 13 6, 2, 17, 19 3, 7, 13 2, 17 3. A hash table of size 63 (i.e. 63 buckets) with 27 buckets occupied has the load factor of 36 0.43 27 2.3 O