On Page 597, implement the Huffman coding algorithm in Code Fragment 13.5 and run your code on Example in Figure 13.12 on Page 596. Your program should print out the table in Figure 13.12 (a) and the tree in Figure 13.12 (b) and the binary code of each character. Please code in JAVA

Chapter 13. Text Processing (a) (b) Figure 13.12: An illustration of an example Huffman code for the input string X= "a fast runner need never be afraid of the dark": (a) frequency of each character of X; (b) Huffman tree T for string X. The code for a character c is obtained by tracing the path from the root of T to the leaf where c is stored, and associating a left child with 0 and a right child with 1. For example, the code for " r " is 011, and the code for " h " is 10111