4. (16 points) (a) (2 points) What is the preorder traversal of the following binary tree? (b) (2 points) What is the inorder traversal of the above binary tree? (c) (2 points) What is the postorder traversal of the above binary tree? (d) (2 points) What is the minimum and maximum number of nodes that a binary tree with height of h can contain? Write the number of nodes in terms of h (e) (4 points) Write a recursive function that returns the height of a binary tree. (f) (4 points) Write a recursive function that returns a count of the number of leaf nodes in a binary tree. Construct testing examples to test your code. (Include screenshots of your return results and submit your java code in a separate file.) Solution