Consider the left-leaning-red-black BST. Find a specific example where a single insertion requires at least four rotations, and the inserted key ends up at the root of the tree. Draw the initial tree (just after the inserted key has been attached as a leaf with a red edge) and also draw the final tree (after all the rotations and color flips are done). Be sure to indicate which edges are red (you may use thick edges to represent red).