Question: Write a C++ function that converts a 2-3-4 tree to a red-black tree.
Your implementation of the trees must use templates so that any (reasonable) data types may be used. Load the 2-3-4 tree with 100 unique random int's with values in the range 200-500. Display the tree in such a form such that it is clear that it is a 2-3-4 tree. Delete any 37 of the values that you inserted, but all of the values that are in the root node must be among those that are deleted. Convert the 2-3-4 tree into a red-black tree. After the conversion, display the converted tree in such a form such that it is clear that it is a red-black tree. Delete any 32 values in the tree, but the value in the root node must be among those that are deleted. Display the resulting red-black tree.