Submit the single java file only DO NOT ZIP it. 1. RECURSIVELY calculate the height of a tree. RECURSIVELY calculate the level of a Node in a tree. 3. Print elements of all the Nodes of a tree using Pre-order Traversal. 4. Print elements of all the Nodes of a tree using In-order Traversal. 5. Print elements of all the Nodes of a tree using Post-order Traversal. 6. Write a method which will evaluate whether two trees are exactly same or not. 7. Write a method which will return a copy (new tree) of a given tree. 8. Write a method that RECURSIVELY searches and finds an integer from a given binary search tree (BST). 9. Write a method that RECURSIVELY prints all the elements of a binary 2.