Question $1$: B$+$ Tree Operations $(26$ points$)$

Assume these rules for $\backslash (\backslash$mathrm$\{$B$\}+\backslash )$ tree operations in this question:

$-$ The B$+$ tree is a $5-$way search tree.

$-$ The left pointer points to values that are strictly less than $(\backslash (<mtext></mtext><mi>\backslash </mi><mi>)</mi><mtext></mtext><mi>)</mi>$ the key value.

$-$ During redistribution, shift elements to$/$from the right node over the left when both are possible redistribution partners.

$-$ During the splitting of a node, the right node will have one more value than the left node.

$-$ For insertions, favor redistribution over splitting.

$-$ Only redistribute one entry at a time.

$1.$ Given the tree below, draw the tree after inserting $21*(2$ points$)$