Problem $6$:

From the following B$-$tree, delete dzo. $($For deletes, always choose the predecessor and prefer left rotate over right rotate$).$

$1.$ First delete 'orc'.

$2.$ Then delete 'roe' from the resulting $2-3$ tree.

$3.$ Then delete 'rat' from the resulting $\backslash (2-3\backslash )$ tree.

Explain all steps and show the tree after each deletion.

Problem $7$:

Calculate the values for the split pointer and the level of an LH hash table with $10$ buckets. Then calculate the buckets were records with hash of key $\backslash (5,6,7,8,9\backslash ),$ and $10$ are inserted.