You are given a hash table of 5 buckets, each of size 2. Using the first bucket hash method described above, put key value iKey into the hash table.
Bucket hash first uses the hash function to select a bucket (the number of buckets serves as the hash table size).
If there is a collision, then linear probing is used to locate another slot within that bucket.
If the bucket is full, then put the record into the overflow.