Assume that the size of this hash table is 7.

Consider an implementation of hash table with separate chaining and the hash function is defined as hash(key) = key mod 7.

You insert the following keys [1, 8, 15, 4, 11, 7, 2] into the hash table.

Which hash position/positions will have 2 or more items in their chain? [3 marks]

Which key would be slowest to search? [2 marks]