Java

After scanning a text file you have the following table of characters and their frequencies: Letter Frequency a 65 16 c 27 d 38 134 25 26 h 59 70 35 Draw the Huffman encoding tree that results from this. Then write down the bit string that would be used to encode each character in the compressed file