Explain each answer.

Select the correct option for the following multiple choice questions or provide short answers accordingly: 1. Consider a hash table with chaining, of size N. Assume in each of the following scenarios the table starts empty. Further assume K pairs of are added and K N Then, in which of the following situations will a find operation for a particular key have a potential worst-case runtime of O(N) a) The keys of all elements are powers of two and the hash function returns a unique index for each key mod N b) The hash function returns a fixed number mod N, but the keys of all elements inserted are uniquee c) Although the hashing function computes a good distribution of key values into the hash table indices, the hash function returns only even numbers. d) The find operation in this problem is never near O(N) 2. You have a hash table of size N = 65. You have total 10,000 elements to insert into the table (e.g., N