Suppose that a block can contain at most four data values and that all data values are integers. Using only B+ trees of degree 2, give examples of each of the following:

a. A B+ tree whose height changes from 2 to 3 when the value 42 is inserted. Show your structure before and after the insertion.

b. A B+ tree in which the deletion of the value 42 leads to a redistribution. Show your structure before and after the deletion.