Assume that you have a B+-tree whose internal nodes can store up to 50 children and whose leaf nodes can store up to 50 records. What are the minimum and maximum number of records that can be stored...

Assume that you have a B+-tree whose internal nodes can store up to 50 children and whose leaf nodes can store up to 50 records. What are the minimum and maximum number of records that can be stored by the B+-tree for 1, 2, 3, 4, and 5 levels?

Implement the 2-3⁺
tree, that is, a 2-3 tree where the internal nodes act only as placeholders. Your 2-3⁺
tree should implement the dictionary interface of Section 4.4.