$2.$ Consider the Linear Hashing index $.$

Linear Hashing

$1.$ Consider the $\backslash (\backslash$mathrm$\{$B$\}+\backslash )$ tree index.

$-$ Every node can contain $\backslash ($ m $\backslash )$ entries, where $\backslash (2\backslash$leq $\backslash$mathrm$\{$m$\}\backslash$leq $4\backslash ).$

$-$ The root node is an exception: it allows $\backslash (1\backslash$leq $\backslash$mathrm$\{$m$\}\backslash$leq $4\backslash ).$

B$+$ tree

A$.$ Show the resulting index after inserting the entry $5*$

B$.$ Show the resulting index after inserting the entry $7*$

C$.$ Show the resulting index after inserting entry $23*$

D$.$ Show the resulting index after inserting the entry $22*$