Problem 2. Write a program in Java or C++ that creates a Red Black tree. Your program should have a search, insert, delete and display operation. You should list these options in a menu to the user. Submit your source code. For the display function you can print one node with its parent and children and their respective colors (given the key of the node), or you can print the entire tree For each insertion/deletion you must display the following: - Initial position of the key into the Red-Black tree List of violated Red-black tree properties The necessary rotations and color assignments Example 1. Insert 20 in the following tree: -Initial position and color: 20 was inserted as right child of 7 (red) List of violations: No violations -Actions required: No necessary rotations or color assignments Example 2. Insert 1 in the following tree: Initial position and color: 1 was inserted as left child of 7 (red) List of violations: Node and parent are both red Actions required: Change colors moving up the tree. No rotations necessary. Example 3. Insert 12 in the following tree: 15 20 Initial position and color: 12 was inserted as right child of 3 (red) List of violations: Node and parent are both red. -Actions required: Node is right child and parent is only right child. Left rotation necessary