Problem
1. Describe, in detail, the insertion and removal algorithms for an (a,b) tree.
2. Suppose T is a multi-way tree in which each internal node has at least five and at most eight children. For what values of a and b is T a valid (a,b) tree?
3. For what values of d is the tree T of the previous exercise an order-d B-tree?