Question 1 1 pts True or false: The performance of a hash table depends entirely on how well the hash function can evenly distribute the set of elements. True False Question 2 1 pts What is the average-case performance of Chained Hashing, given m slots and n keys to insert such that that each key is equally likely to be hashed to any slot of the table? (1+n/m) (m) (n) (1+m) Question 3 1 pts True or false; In the division method for creating hash functions, we map a key k into one of m slots by taking the remainder of k divided by m. A prime not too close to an exact power of 2 is often a good choice for m. O True O False