Write a method in java that will create a Huffman tree considering below; HuffmanNode class has the public class variables; float frequency, String symbol, HuffmanNode left, right, next. The constructor takes frequency and symbol values.LinkedListHuffman class has private class variable; HuffmanNode head and the following methods implemented in this class for you to use in case you need them;

Public void insertSorted$($HuffmandNode newONe$)//$ insert a given node into the linked list in an ascending order based on their frequencies.

Public HuffmanNode delete$()//$remove the first element$($with the lowest frequency$)$ from the linked list and returns it$.$

Public int count$()//$ will count the number of elements in the linked list.

Assume that for each symbol in your text, the frequency was found, HuffmanNode was created and inserted into a linked list using the method mentioned above. The method that you are going to write will be in the HuffmanTree class. This class has a variable root in the type of HuffmanNode.

Public void createHuffmanTree$($LinkedListHuffman list$)\{//$list is the sorted one based on frequencies$\}$