Suppose that we are using extensible hashing on a file that contains records with the following searchkey values:

( 2369, 2428, 4750, 6975, 9208, 1821, 4692, 3943, 1620, 7115, 4871, 5659, 1074, 4981, 1453 )

Load these records into a file in the given order using extensible hashing. Assume that every block (bucket) can store up to four (4) values.

Show the structure of the directory after every 3 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, 1 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).