Problem
1. Draw the B-tree that is built when sixteen equal keys are inserted into an initially empty tree, with M = 5.
2. Suppose that one page from the database is destroyed. Describe how you would handle this event for each of the B-tree structures described in the text.