write program that transforms postfix expression into tree such as that shown in figure in this you'll need to modify the tree class from the tree java program (listing and the parsepost class from the postfix java program (listing in there are more details in the discussion of figure after the tree is generatedtraversals of the tree will yield the prefixinfixand postfix equivalents of the algebraic expression the infix version will need parentheses to avoid generating ambiguous expressions in the inorder(methoddisplay an opening parenthesis before the first recursive call and closing parenthesis after the second recursive call write program to implement huffman coding and decoding it should do the followingaccept text messagepossibly of more than one line create huffman tree for this message create code table encode the message into binary decode the message from binary back to text if the message is shortthe program should be able to display the huffman tree after creating it the ideas in programming projects and might prove helpful you can use string variables to store binary numbers as arrangements of the characters and don' worry about doing actual bit manipulation unless you really want to