Problem
1. Insert the following entries, in the order stated, into an initially empty B-tree of order (a) 3, (b) 4, (c) 7
A g f b k d h m j e s I r x c l n t u p
2. What is the smallest number of entries that, when inserted in an appropriate order, will force a B-tree of order 5 to have height 3 (that is, 3 levels)?
3. Draw all the B-trees of order 5 (between 2 and 4 keys per node) that can be constructed from the keys 1, 2, 3, 4, 5, 6, 7, and 8.