Assume an empty hashtable index using extendible hashing with buckets of capacity

two records each. Its particular hashing function maps the $d$ least significant bits of each

number to a bucket, where $d$ is the global depth.

The hash table starts with zero entries and a single bucket. The global depth $d$ is

After inserting $4,5,16,9$ and $19,$

The global depth d is

and the number of buckets is

The local depth d$\text{'}$ of the bucket that contains $19$ is