Insert the letter D into the following red-black tree, and t…
Insert the letter D into the following red-black tree, and then answer the following questions about the trace of that insertion: a. Which node is the new D initially inserted below? b. What are the first two nodes to be rotated through this trace? c. What are the first three nodes to be recolored through this trace? d. How many red nodes are there in the final tree after all repairs?