(25 points) Construct a B+-tree for the following set of key values:
49, 17, 21, 16, 34, 42, 81, 39, 41, 27, 1, 5, 83, 6
- Let n = 3. Assume the tree is initially empty.
- Add the values in the order given here.
- Remember that when splitting a leaf node ceiling(n/2) keys
should go in the left node and the remainder in the new right node.
- Show the tree as each new node is added.