Question :
Consider a linear hash table that uses 4-bit hash keys and stores two records per bucket.
The capacity threshold is 75%; that is, we create a new bucket whenever the number of records is more than 3/2 the current number of buckets.
Simulate the insertion, into an initially empty hash table, of records with (hash values of) keys 1111, 1110, 1101,..., 0001, 0000, in that order.
Indicate what happens after each insertion.