1. Execute the following sequence of operations on an initially empty dictionary book that is implemented as a B-tree of degree 5. Note that insertion into an empty B-tree will create a single node...

1. Execute the following sequence of operations on an initially empty dictionary book that is implemented as a B-tree of degree 5. Note that insertion into an empty B-tree will create a single node that contains the inserted item.

2. Given the B-tree of degree 7 in Figure 21-18 , draw the B-tree that results after the removal of s , t , p , m , k , and e .