DATABASE SYSTEMS QUESTION

Consider an extendable hash structure where buckets can hold 4 search-key values. Assume that the entries with the key values listed below are inserted using their most significant bits indicated in binary format in parenthesis. Using the extendable hashing method, show the contents of the hash table and the bucket address table after inserting the following integers. 1 (000001), 2 (000010), 5 (000101), 9 (001001), 12 (001100), 21 (010101), 23 (010111), 33 (100001), 40 (101000), 45 (101011), 52 (110100), 57 (111001), 61 (111101), 62 (111110), 63 (111111). (a) Insert 33, 9, 40, 57, 21, 12, 1, 61, 2. (b) Insert 23, 52, and 45 to the resulting structure in (a). (c) Insert 5, 62, and 63 to the resulting structure in (b). (d) Delete 21, 23 and 52 from the resulting structure in (c).