Problem: Using a Red-Black Tree, create a Balanced Binary Search Tree for the following list (ordered by insert): A = [7, 2, 1, 3, 5, 8, 9, 10, 6, 4] Show how the tree changes for each insertion and rotation. Be sure to indicate whether a node is red or black. Describe any imbalance in the tree (e.g. LL, LR, RL, RR). Then show how to fix the imbalances through rotations and when you recolor nodes. In other words, draw the tree for each major change (e.g. insert rotation), showing the transitions with arrows.

Problem: Using a Red-Black Tree, create a Balanced Binary Search Tree for the following list (ordered by insert): A = [7, 2, 1, 3, 5, 8, 9, 10, 6, 4] Show how the tree changes for each insertion and rotation. Be sure to indicate whether a node is red or black. Describe any imbalance in the tree (e.g. LL, LR, RL, RR). Then show how to fix the imbalances through rotations and when you recolor nodes. In other words, draw the tree for each major change (e.g. insert rotation), showing the transitions with arrows.