Suppose that we are using extensible hashing on a file that contains records with the
following search-key values:
(449, 124, 654, 831, 1016, 176, 285, 468, 615, 340, 331, 135, 667, 818, 117, 429)
load these values into a file in the given order using extensible hashing. assume that
every block (bucket) of the hash index can store up to four (4) values.
show the structure of the hash index after every 4 insertions, and the global and local
depths. use the hash function: h(k) = k mod 128 and then apply the extensible hashing
technique. using this function, every number is mapped first to a number between 0 and
127 and then we take its binary representation. then, the extensible hashing technique
is applied on the binary representation. furthermore, initially, you start with a single
bucket and a single pointer and the global and local depths are zero (0).