A hash table of length 10 uses open addressing with hash fun…

A hash table of length 10 uses open addressing with hash function h(k) = k % 10, and separate chaining. After inserting several values into an empty hash table, the table is as shown below.  0 1 2 42 3 23 4 5 55 6 46 7 8 9 At what index will the value 12 be inserted?

In merge sort, assume L and R have been sorted and it is tim…

In merge sort, assume L and R have been sorted and it is time to merge them together. Assume L == 4, 5, 8, 10, 11 and R == 1, 2, 7, 9, 23. What elements will be compared after 2 elements have already been inserted into the sorted array? In other words, what numbers are compared the third iteration of merge? Separate your values by a single space and put your values in numerical order.