25.17 ( Data compression: Huffman coding animation) Write a Java program that enables the user to enter text and displays the Huffman coding tree based on the text, as shown in Figure 25.25a. Display the weight of the subtree inside the subtree's root circle. Display each leaf node's character. Display the encoded bits for the text in a label. When the user clicks the Decode Textbutton, a bit string is decoded into text displayed in the label, as shown inFigure 25.25b.

Name your program Exercise25_17

Your output maybe different than Figure 25.25 (a & b)

Exercise25 17: Huffman Coding Animation Enter a text: Welcome Show Huffman Tree Fnter a hit string Decode to Text 7.0 3.0 4.0 1.0 2.0 2.0 2.0 1.0 1.0 1.0 1.0 Exercise25 17: Huffman Coding Animation Enter a text Show Huffman Tree Fnter a hit string: 0001001110110111 Decode to lext 7.0 3.0 4.0 1.0 2.0 2.0 2.0 1.0 1.0 1.0 1.0 0001001110110111 is decoded to omleWc FIGURE 25.25 (a) The animation shows the coding tree for a given text string and the encoded bits for the text are displayed in the label; (b) You can enter a bit string to displajy its text in the label