We want to index the following key values based on an extensible hash table. Such keys are inserted into the database in the order of 21, 35, 49, 56. The hash function h(x) for the key x is (x mod 32). Namely, the hash value is the remainder of the key x divided by 32, and it is a 5-bit value. Assume each block holds 2 tuples.

1. (10 Points) Please draw the hash table containing the hash structure in main memory and the data blocks on disks after these four keys are inserted. Make sure to indicate the number of bits used during hashing;

2. (10 Points) We keep inserting 82 and 89 into the hash table. Draw the table to refl the new values. Be sure to indicate the number of bits used during hashing.