ashing example #$1$

Simulate the behavior of a hash map as described in lecture, Assume the following:

$$ the hash table array has an initial capacity of $5$

$$ the hash table uses separate chaining for collision resolution

$$ the hash function returns the integer key's value, mod the size of the table

$$ rehashing occurs at the end of an add where the load factor is $>=0\mathrm{.}6$ and doubles the capacity of the hash table