Please draw out each tree for the each questions, thanks a bunch!

Problem 3. (40 points) Answer the following problems. For each problem, start with the B+-tree in Figure 1. (a) (10 points) Show the tree that would result from inserting 4 into the tree. 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) Show the tree that would result from deleting 8 from the tree, assuming that the left sibling is checked for possible merging or redistribution. You may omit the parts of the tree that do not change. (c) (10 points) Show the tree that would result from deleting 58. You may omit the parts of the tree that do not change. (d) (10 points) Show the tree that would result after the following sequence of deletions: 73,45 , 41,39,32. You may omit the parts of the tree that do not change. Problem 3. (40 points) Answer the following problems. For each problem, start with the B+-tree in Figure 1. (a) (10 points) Show the tree that would result from inserting 4 into the tree. 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) Show the tree that would result from deleting 8 from the tree, assuming that the left sibling is checked for possible merging or redistribution. You may omit the parts of the tree that do not change. (c) (10 points) Show the tree that would result from deleting 58. You may omit the parts of the tree that do not change. (d) (10 points) Show the tree that would result after the following sequence of deletions: 73,45 , 41,39,32. You may omit the parts of the tree that do not change