write this code in java language. find the characters and their frequincies of a given text which will be read from letter.txt file. keep these in a sorted linked list $($use your own linked list class$)$ construct the huffman tree using the characters that you keep. then find the code of every character and display them.