SimpleDB splits a B-tree block as soon as it becomes full. Another algorithm is to allow blocks to be full and to split them during the insert method. In particular, as the code moves down the tree...

SimpleDB splits a B-tree block as soon as it becomes full. Another algorithm is to allow blocks to be full and to split them during the insert method. In particular, as the code moves down the tree looking for the leaf block, it splits any full block it encounters.

(a) Modify the code to implement this algorithm.

(b) Explain how this code reduces the buffer needs of the insert method.