Add elements to Red-Black Trees (in the photo below) so that each scenarios (cases) in the algorithm (Above) is executed.

That is, all lines of code in pseudo-code are executed.

Please draw multiple RB tree diagrams to clearly demonstrate the progress of the algorithm for each additional entry.

Please use the tree below to continue to add nodes. Thank you.

Red-Black insert Node algoritl redBlackInsertNode (Node root, Node x) [ currentNode = root; parentNode = null; while ( currentNode empty) { parentNode if( x.key currentNode.key) currentNode currentNode.right currentNode; currentNodecurrentNode.lefti return "found, cannot insert"; //Was not discussed earlier. parentNode.left x; currentNode.parent parentNode; if (parentNode = null) else if (x.key