a.) Below is an example of Extendable hashing (dynamic hashing) 2 and 4 's final two bits are 00 . As a result, bucket B0 will receive it. Since the last two bits of both 5 and 6 are 01, place it in bucket B1. Since the final two parts of 1 and 3 add up to 10 , it will be placed in bucket B2.7 will fall into B3 since its final two bits are 11. Insert Key 10 with hash address 10110 into the above data structure. Draw out the data buckets after hashing. b.) You have a slot directory-based page format for variable-length data. It is utilizing a maximum size (i.e., a maximum number of slots) and allocating the directory array when the page forms is one method of managing the slot directory. What are the advantages of this layout over the traditional heap file in DBMS? c.) Propose a change to the layout of this page that would enable us to sort the records (following the value of a field) without moving the records or modifying the record ids. d.) Is the following tree a clustered or unclustered tree index? Give your reasons why