Answer ASAP please. Considering fixing up the color, insert node $23$ into the following red$/$black tree, e$.$g$.,$ T$.$ In T$,$ we denote

each node with a positive value as the node with BLACK color and the node with a negative value as the node with RED

color. For simplicity, we consider each node only comes with a positive key value in the RB tree T$,$ here. For example, in

T$,$ node $1,15,17,24,39$ are with BLACK color, and node $2,13,22,28$ are with RED color.

Note: show your intermediate steps. A partial credit will be given based on the work you write down.

RB$-$INSERT $(T,23)$

$[$B $-3$ pts $]$ Answer the following questions. There is ONLY one correct answer in each question below.

Following the same setting in question $1,$ we denote each node with a positive value as the node with BLACK color and

the node with a negative value as the node with RED color.

Now consider inserting node $14$ into the RB tree above.

Q$1$: Which of the following best describes the place of node $14$ AFTER the insertion step but BEFORE fixing up the

color? $1pt$

A$)$ Node $14$ is the right child node of Node $22.$

B$)$ Node $14$ is the right child node of Node $13.$

C$)$ Node $14$ is the left child node of Node $39.$

Q$2$:Which rule$($s$)$ would apply when fixing up the color? $[1$ pt$]$

A$)$ Only Rule #$1$ applies.

B$)$ Only Rule #$2$ applies.

C$)$ Neither Rule #$1$ nor Rule #$2$ applies.

Q$3$: Does it need a transition step if Rule #$2$ applies when fixing up the color? $[1$ pt $]$

A$)$ Yes.

B$)$ No$.$