Construct a B+-tree for the following set of key values:

39, 29, 57, 53, 80, 31, 67, 46, 24, 88, 63, 23, 101, 74, 82, 105

Assume the tree is initially empty and the values are added in the order specified by the above list. The maximum number of search key values that will fit in one node is FOUR. When splitting an overflowing node with an odd number of values, you always put one more value in the right hand side node.