Given the following $2-3$ BST create a left$-$leaning red$-$black balanced search tree with the same structure. Describe the tree using the following templates:

red$/$black node $...($e$.$g$.$ red node A$)$

null

$2-3$ BST:

root node C

left node of the root A $$B

right node of the root$$D$$E

Which is the right node of the left node of the root node of the corresponding left leaning red$-$black BST$?$

In order to answer you must construct the $2-3$ tree and the red$-$black tree for the description above. You are allowed to use paper to prepare the answer of this question.