Assuming a B+tree (note: plus!) of Order 2 (with Order defined as in our in-class (Comers) BTree definition), insert the values K, B, G, D, S, T, and M, in the order presented. Show the tree after the completion of each insertion that causes the tree to grow by a level, and show the final tree.

After this, from your final tree, delete the following keys, and show the final tree: M and G (in that order). You may show intermediate trees if you so desire.