CPS $5440$: Unit $8$ Assignment

Show all legal $2-3-4$ trees $($i$.$e$.,$ B$-$trees of order $2)$ that represent $\{1,3,6,7,9\}.$

If a B$-$tree is of order $b,$ then what is the maximum number of keys that can be stored if the B$-$tree has height $h?$

Starting with an empty B$-$tree of order $2($i$.$e$.,$ a $2-3-4$ tree$),$ what is the final configuration after inserting, in order, the following keys:

G$,$ T$,$ R$,$ L$,$ D$,$ M$,$ I, U$,$ W$,$ X$,$ N$,$ S$,$ O$,$ Q