Question III (20 points total) Answer the following questions. For each question, start with the B+-tree in Figure 1. You may omit the parts of the tree that do not change. SO 163240 7385 6H 10 H10211-3239 80 91 Figure 1: B+-Tree Example (a) (10 points) Draw the tree that would result from inserting 3 into the tree in Figure 1. When a node is split into two nodes, ensure that the left node does not have fewer keys than the right node. (b) (10 points) Draw the tree that would result from deleting 8 and 52 from the tree in Figure 1. When a node is underfull and it has two adjacent sibling nodes, use the left sibling node to handle this underfull situation