B$+$ tree insertion$/$deletion problems. solve following $2$ questions in detiail. provide step by step and final tree drawing$($ hand drawding is prefered with correct pointers$).$ Draw the tree that would result from deleting $1,2,$ and $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. 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. Figure $1$: B$+-$Tree Example