Show the smallest Red-Black tree such that when a new node is inserted it violates property 4 of Red-Black trees, as discussed in Section 10.2 (if a node is labeled red, then its two child nodes must be labeled black). 1. Explain why the insertion violates this Red-Black tree property. 2. Describe what operations must be applied to regain its Red-Black status.