Draw/represent the 2-3-4 trees that results when you insert…

Draw/represent the 2-3-4 trees that results when you insert the keys into an initially empty tree.  Draw/represent each intermediate tree – make sure that you split the 4-nodes at the proper time! Also, CLEARLY denote when and where the splits occur.                         I    U    S    B    T    I    T    A    N    P    R    I    D     Be very clear in your representation.  As an example, the following is a 3-node (FR) with one 2-node child (A), one 3-node child (HJ) and one four-node child (SUV).            3node:       F       R                          A      H J    SUV