Assignment 6 (Assigned 10/10, Due 10/24) 1. [34%] Textbook question R-8.22 on page 351. Draw a binary tree T that simultaneously satisfies the following: . Each internal node of T stores a single character. . A preorder traversal of T yields EXAMFUN. . An inorder traversal of T yields MAFXUEN. E X N U M 2. [66%] Inputs are arithmetic expressions using single digit letter operands; operators +, -, *, and /; and braces (), . and (). Write a Java program to convert such an input into a binary tree, and using preorder/inorder/postorder traversal of the tree to confirm that your binary tree is correctly representing the original expression. Submit source code and sample run screen captures