Exercise 14.2.5: Execute the following operations on Fig. 14.13. Describe the changes for operations that modify the tree.

. f) Insert a record with key 1.

g) Insert records with keys 14 through 16.

h) Delete the record with key 23.

i) Delete all the records with keys 23 and higher.

first two pointers must be present in an interior node. 13 23 31 43 2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 Figure 14.13: A B-tree