Problem
1. Write a Java class that can take any red-black tree and convert it into its corresponding (2,4) tree and can take any (2,4) tree and convert it into its corresponding red-black tree.
2. Perform an experimental study to compare the performance of a red-black tree with that of a skip list.