We have the following sequence of keys:

$(5,16,22,45,2,10,18,30,50,12,1,55)$

Consider the insertion of items with this set of keys in the order given into an initially

empty $(2,4)$ tree.

If a $(2,4)$ tree, T$,$ is storing $100,000$ items, what is the worst height of T$.$