Suppose we were to start with an empty B-tree and insert the following nodes in order: Y, Z, R, S, N, P, E, L, X, C, W, K, A, D, H

t = 2, so the order 2t = 4 and the maximum number of keys which will fit in a node is 3. Please remember that, unlike the textbook, we assume that when there is overflow at a node with 4 keys, the 2nd key from the left is the one which gets promoted.

Show what the B-tree will look like after each time that some node is split. Please show the B-tree only after a node is split, you do not have to show what the B-tree looks like when keys are added which do not lead to a split.

Show and explain in simple terms what the B Tree looks like at the end