Assume that a tree node in a B+-tree has room for 4 pointers. Show a B+-tree, containing the fewest possible nodes, for the following key values:

5, 51, 31, 29, 22, 20, 4, 60, 41, 40, 12

You do not have to show the steps resulting from one-by-one insertion. Just show the final tree structure. Be careful to use the right node size. 4 pointers means each node has at least 2 search-keys. Also, remember that at the leaf level, we use one pointer to link all the leaves, so there is room for only 3 pointers to records/buckets.