Use B-Tree as a sorting machine. Write a java program thats passes an array of key values from main() to B-Tree and it writes them back to the array in sorted order.

NOTE: Could you traverse the B TREE, (NOT BINARY SEARCH TREE) according to inorder traverse? [5,6,4,8,10,22,35,46,15,52] ---> B-Tree ---> [4,5,6,8,10,15,22,35,46,52]