1 Do the same as in Exercise 11.4 but for a hash table of size 2031 that contains 999 keys. 2 Show why the table size must be a prime number in order for double hashing to visit every entry during the...

1 Do the same as in Exercise 11.4 but for a hash table of size 2031 that contains 999 keys.

2 Show why the table size must be a prime number in order for double hashing to visit every entry during the probe.

3 Design a hash function that can be used to map the two-character state abbre- viations (including the one for the District of Columbia) to entries in a hash table that results in no more than three collisions when used with a table where M 100.