Mark all the statements that are true about inserting a new key into a LLRB tree?

Insert the new key using the BST insert algorithm.

Color the new key's parent link black.

Color the new key's parent link red.

There may be additional rotations and flips of colors to restore color invariant.

Question $3$

$0\mathrm{.}25$ pts

Mark all statements that are true about a LLRB tree $3-$node.

A node that contains $2$ keys.

Two $2-$nodes connected by a red link.

The larger key is the root of the connected two $2-$nodes.

The smaller key is the root of the connected two $2-$nodes.