${?}_{\text{R}\text{e}\text{v}\text{i}\text{e}\text{w}\text{Q}\text{u}\text{e}\text{s}\text{t}\text{i}\text{o}\text{n}\text{.}pdf}$

$a$

ve rave tre rollowing sequence or 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.$