1. This project should be easy. Write a method that returns the minimum value in a 2-3-4 tree.
2. Write a method that does an inorder traverse of a 2-3-4 tree. It should display all the items in order.
3. A 2-3-4 tree can be used as a sorting machine. Write a sort() method that's passed an array of key values from main() and writes them back to the array in sorted order.