I have this question from my homework regarding my Algorithms and Data Structures class.

4.

a) Alice says that a hash table with collisions handled using separate chaining can have a load factor greater than 1. Bob says that this is impossible. Who is right, and why?

b) Bob says that a hashtable with collision shandled using open addressing can have a load factor greater than 1. Alice says that this is impossible. Who is right, and why?

c) Bob wants to create a linked list. Describe the limitations of using a linked list to store a collection of key-value pairs subject to put(k, v) and get(k).