this is all database related

Answer the following questions assuming $4$ data entries fit in each bucket. Use your

answer from part $($a$)$ to answer parts $($b$),($c$),$ and $($d$).$

$($a$)$ Show the diagram of an Extendible Hash index with data entries hashing to the following

values

$\{3,5,7,9,10,15,25,31,44,64\}$ using $4$ buckets $($i$.$e$.$ a global depth of $2).$

$($b$)$ What is the maximum number of data entries that can be inserted $($given the best possible

distribution of key values$)$ before you have to split a bucket? Explain briefly.

$($c$)$ Draw a diagram of the index $($i$.$e$.$ directory and buckets$)$ after inserting a single record

whose insertion causes a bucket split.

$($d$)$ What is the minimum number of record insertions that will cause a split of all four buckets?

Explain briefly.