HUFFMAN CODING

Write a Java program that implements the Huffman coding algorithm.

Part I is to read in a piece of text from the user. The program should count how many times each letter appears in the text and print out that information. For example:Part II is to create a new Binary Tree for each of the letters, add them into a Priority Queue and then keep combining the trees until only one is left $($you can use the Tree and Node classes provided$)$

Part III $($optional for $10/10)$ is to derive the Huffman encoding for the piece of text by using the resulting Huffman tree.