Write a program that takes as input a fully parenthesized, arithmetic ex- pression and converts it to a binary expression tree. Your program should display the tree in the following way and also print...

Write a program that takes as input a fully parenthesized, arithmetic ex- pression and converts it to a binary expression tree. Your program should display the tree in the following way and also print the value associated with the root.Your program should draw the binary tree T by assigning x- and y-coordinates to each node p such that x(p) is the number of nodes preceding p in the preorder traversal of T and y(p) is the depth of p in T. You may then use these values to fill a character matrix and print the tree.Challenge case: Allow the leaves to store variables of the form x1, x2, x3, and so on, which are initially 0 and which can be updated interactively by your program, with the corresponding update in the printed value of the root of the expression tree.