Question #1: How unbalanced can a red-black tree be? How much taller can the left subtree be compared to the right subtree? Explain your answer. Question #2: Using the ascii-art binary tree below, make a red-black tree with height 4 using the fewest number of nodes. That is, for each node, either replace the "X" with a "b" for black, "R" for red or spaces to indicate the absence of a node. Please don't use tabs, people have different tab stop settings and that would ruin the ascii art. Also "B" and "R" look too similar, so use lower case "b" for black. X / \ ___________/ \___________ / \ / \ X X / \ / \ ___/ \___ ___/ \___ / \ / \ / \ / \ X X X X _/ \_ _/ \_ _/ \_ _/ \_ / \ / \ / \ / \ X X X X X X X X / \ / \ / \ / \ / \ / \ / \ / \ X X X X X X X X X X X X X X X X