Please use Java to answer the following question.

Develop the Huffman code tree for the following character set and generate the compressed form of "abracadabra". Lower frequencies should be the left child of newly created nodes (similar to the pseudo code in the textbook). {"a"=0.15,"b"=0.25,"c"=0.1,"d"=0.3,"c=0.2}1001100011010101101101100011011010011110111000011011100001110000110100111101110000110111000011011100001101001111