Problem 3

Consider a B+-tree of order 2 (i.e., d = 2 and max. keys=4). Insert the following keys in order: 10, 20, 60, 7, 30, 66, 1, 73, 2, 85, 9, 88, 95, and 90.

Show the final tree. Part points will be awarded for each correct insert if you show your intermediary work.

Show the tree after each of the following deletions: 7, 85, 60