B+-tree in Figure 1. Answer the following problems. For each problem, start with the 8 16 32 52 73 85 12 -810 -1827 -323941-5258 -7380-9199 Figure 1: B+-Tree Example (a) (10 points) Draw the tree that would result from inserting 40 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. If a node requiring merging/redistribution has both left and right sibling nodes, use the left sibling node for merging/redistribution. You may omit the parts of the tree that do not change. (c) (10 points) Draw the tree that would result from deleting 52 from the tree in Figure 1. If a node requiring merging/redistribution has both left and right sibling nodes, use the left sibling node for merging/redistribution. You may omit the parts of the tree that do not change. (d) (10 points) Draw the tree that would result from deleting 32, 39, 99, 1, 2, and 8 from the tree in Figure 1. You may omit the parts of the tree that do not change. Ac Go