Problem
1. Draw the mirror images of the three cases for insertion into a Red-Black tree and explain how each situation is resolved.
2. Show the AVL tree that would be formed by inserting the month names (12 strings) in their normal calendar sequence.
3. Show the Red-Black tree that would be formed by inserting the month names in their normal calendar sequence.