Problem
1. Give the contents of the B-tree that results when the keys EA S YQUES T I O N are inserted in that order into an initially empty tree, with M = 5.
2. Give the contents of the B-tree that results when the keys EA S Y Q U E S T I 0 N are inserted in that order into an initially empty tree, with M = 6. Use the variant of the method in which all the records are kept in external nodes.