Consider the B+ tree index of order d = 4 (block size is 4) shown in the following Figure. (20 points)

1) Show the tree that would result from inserting a data entry with key 9 into this tree.

2) Show the B+ tree that would result from inserting a data entry with key 3 into the original tree.

3) Show the B+ tree that would result from deleting the data entry with key 8 from the original tree.

4) Show the B+ tree that would result from deleting the data entry with key 91 from the original tree.

Root 50 73 85 8 1832 40 1256810 18 27 41 45 52 58 73 80 91 99