Construct a B+ tree for the following keys, starting with an empty tree. Each node in the tree can hold a maximum of 2 entries (i.e., order d = 1).
Start with an empty root node, and show the state of the B+ tree every time you split a node-and at the end. It is OK to continue to insert new keys into the structure without redrawing it, if it doesn't split; but, as soon as the next split occurs, draw the resulting tree.
Insert the keys in this order:
14, 33, 21, 17, 22, 3, 1, 35