Question One: Code the Following: In Java, write, document, and test classes for: 1. 1. a generic binary tree 2. 2. an m-ary tree 3. 3. an expression tree. Use it to store the expression (2+43). 4. 4. an operating system's disk-directory tree and its contents. 5. Each item in the directory should have a name and a 6. reference to a subtree. An entry that is a file 7. should have null subtrees. 8. 5. Write and test Java code, given root, to: 9. 6. find the height of a tree 10. 7. count the leaves 11. 8. count the nodes 12. 9. tell whether the tree is balanced 13. 10. count the siblings of a node 14. 11. find the total number of nodes in a general tree 15. 2.4a Explain a tree traversal B: (1-3) Use a stack or queue library class, as appropriate, to: 1. check the nesting of parentheses, or braces in a Java source file 2. check the nesting of tags, such as htm>,/htm,p,p etc., in an HTML file. 3. implement a reverse Polish notation calculator. 4. Write a method that takes integer-stack and integer parameters s and n, and returns the value of the nth item from the top of s, leaving the stack intact. 5. Write a program that reads a Java program and outputs a file with all method definitions removed. To accomplish this, you must use a stack