Show the results of inserting the keys E, F, G, U, V, W, H in order into the B-tree shown below. Assume this B-tree has minimum degree k = 2. Draw only the configurations of the tree just before some node(s) must split, and also draw the final configuration. Suppose you have a B-tree of height h and minimum degree k. What is the largest number of keys that can be stored in such a B-tree? Prove that your answer is correct