Consider the Extendible Hashing index shown in the figure below. Answer the following questions about this index:

Denote by M the number of insert data entries in the index after the occurrence of the last split. What is the minimum value of M. Argue your answer.

Show the index after inserting an entry with hash value 76.

Show the original index after inserting entries with hash values 25 and 101.

64 16 Bucket A 3 2 001 010 011 100 101 110 11521 Bucket B 2 6 Bucket C 2 15 7 51 Bucket D 3 DIRECTORY 4 12 20 36 Bucket A2 64 16 Bucket A 3 2 001 010 011 100 101 110 11521 Bucket B 2 6 Bucket C 2 15 7 51 Bucket D 3 DIRECTORY 4 12 20 36 Bucket A2