Question 7 (1 point)

The keys 12, 18, 13, 2, 3, 23, 5, and 15 are placed into an emptyy hash table of length 10 with address values of 0 through 9 using open addressing, hash function of h(k) = k mod 10 and linear probing. If inserted in the order given the 15 will go in shich slot?

Question 7 options:

Question 8 (1 point)

The minimum possible time complexity for a comparison based sorting algorithm and a random input array is O(n)

Question 8 options:

	1) True
	2) False