I need help with 3b, 3c and 3d please!

9.31 Answer the following questions (a) Explain advantages of using extendible hashing (b) Let us assume global depth is 2 and bucket size is 4. The hash funetion kesyw s The current snapshot of the content of the directory and buckets is shown below content of the directory and buckets after you insert the key 68 into the Hkey)-key mod 64 extendable hash table Show g-2 00 O1 10 11 1 2 8 204 641 258 I=2 120 700 1586 148 288 1064 (c). The current B+ tree snap shot is shown below (with fill factor 50%). Show B+ tree after key 25A 50 6075 75 80 85 90 5110115120 251281301 E 0133111616 P E 1 ole 90] 5 10 15 20 125 28 30 d) Let us assume that a node of a B+ tree is implemented as a block whose size is 4K bytes. A key in a node takes 12 bytes and the size of a pointer in a node is 8 bytes. Let us assume we have total b blocks in the leaf level. If a fill factor of the B+ tree is 67%, the maximum number of keys in a node is approximately 200. Calculate average fan-out and height of the B+ tree. 1Q.4] Answer the following questions (a) The initial query plan generated by the SQL query parser of the DBMS is shown below Query: SELECT LNAME FROM