a) Insert the following keys into an empty B+-tree of order 2 (maximum keys=4): 12, 22, 66, 7, 30, 68, 1, 75, 4, 87, 9, 88,99, and 92 . You may show the final tree only if you wish, however, part marks will be awarded for each correct insert. (7 marks)

b) Show the tree after each of the following deletions: 7, 87, 66. (3 marks)