Construct a B + -tree for the following set of values: (2, 3, 5,
7, 11, 17, 19, 23, 29, 31). Assume that the tree is initially empty
and the values are added in ascending order. Let the degree of the
tree be four, i.e. at most four pointers are allowed in any node.
In your answer show the final tree.
a) Show your tree from Q.6. after we insert 10.
b) Show your tree from Q.6. after we delete...