IT HAS TO BE IN B+-tree format.

meaning that the leaf node should have at least 2 key.

Problem 3. (50 points) Answer the following problems. For each problem, start with the B+-tree in Figure 1. 50 B 16 32 73 || 85 | 25 H2100 -18% - 2259 ||-|-||$|| 117 ||80 Figure 1: B+-Tree Example H-9099 (a) (10 points) Draw the tree that would result from inserting 6 into the tree in Figure 1. When a node is split into two nodes, ensure that the right node has no more keys/pointers than the left node. You may omit the parts of the tree that do not change. (b) (10 points) Draw the tree that would result from deleting 8 from the tree in Figure 1. When node merging or redistribution is needed, if both the left and right sibling nodes are available, use the left sibling node. You may omit the parts of the tree that do not change. (c) (10 points) Draw the tree that would result from deleting 39 from the tree in Figure 1. You may omit the parts of the tree that do not change. (d) (10 points) Draw the tree that would result from deleting 91, 80, and 73 from the tree in Figure 1. You may omit the parts of the tree that do not change