a$)$ Starting with an empty $2-3$ tree, draw each $2-3$ tree resulting from inserting each of the following values $($in the same order listed here:$)\backslash (2,1,4,5,9,3,6\backslash ).$ You don't need to draw the adjustment steps for each insertion, only the final $2-3$ tree after each insertion. Take your time and double check your solution to this part. The remaining parts depend on your answer to this one.

b$)$ Draw the final $2-3$ tree as a left$-$leaning red$-$black tree.

c$)$ Now insert the value $7$ to the final $\backslash (2-3\backslash )$ tree, but this time do it in detail by showing the transitional $2-3$ tree until the $2-3$ tree is balanced. For each step, draw the equivalent red$-$black tree for each $2-3$ tree. Highlight the left$/$right rotation operation at each step. All red$-$black trees should be left$-$learning. Draw your trees in two columns. The left for the $2-3$ tree and the right for the red$-$black tree. Make sure the equivalent trees are drawn on the same row. Make sure your work is neat and clear.