1) Find the resultant/final B-tree assuming the following:

• The maximum number of entries per node is 2 (hence min is 1). Remember, nodes have exactly one more child pointer than entries.
• When spitting a node into two nodes (hence 3 entries into two nodes) the extra entry goes to the left sibling
• The parental separator is set to the largest entry in the left child, i.e. the left-hand-side contains entries less than or equal to the separator.
• You insert the following in this order (starting from an empty tree): 5, 25, 80, 10, 15, 20, 8, 12, 3

2) Consider this B-tree. Show the resultant B-tree after deleting the entry for 30.

Assume the following:

• The maximum number of entries per node is 6 (hence the min is 3).
• When spitting a node into two nodes or borrowing from a sibling node if there is an odd number of entries the extra entry goes to the left sibling.
• The parental separator is set to the largest entry in the left child, i.e. the left-hand-side contains entries less than or equal to the separator.

lins L extra to left 100/2001 110 1120 125 140 150 160 201210/220/230 240 250