Using the $B+$ tree below as a starting point, answer the following questions once you have performed the activity described. Each question starts from the original tree $-$ i$.$e$.$ the changes are not cumulative. If a leaf node is already full and you are trying to add to it$,$ split the leaf node into two leaf nodes.

How many index nodes will change with the deletion of $10$ in the original tree? Note that the root node is also an index node.

How many index nodes will there be after inserting $14$ in the original tree? Note that the root node is also an index node.

What will be the contents of the root node if $50$ is deleted in the original tree?