2. Implement a Huffman Coding Tree based off of the design in question (a) Your tree should build itself using https://users.encs.concordia.ca/-sthiel/comp352/Jabberwock.txt (b) Include the characters for spacing as well as all punctuation, but not line breaks. (c) You should not make encoding for characters not found in the source text, and I will not use any such characters while testing your code. (d) Weight should be based on the frequency of occurrence and the order in which a node is encoun tered. That is, f 'e' and have the same frequeney, but 'e' occurs first, its weight would be considered greater. 'weigh' more than something with the same weight that is already on the priority queue on the left, the other node on the right. java Huffman (e) When merging nodes, the new weight should be the sum of the previous weights but it should (f) When merging nodes, lesser nodes (by weight, and then if there is a tie, by occurrence) should be 2. Implement a Huffman Coding Tree based off of the design in question (a) Your tree should build itself using https://users.encs.concordia.ca/-sthiel/comp352/Jabberwock.txt (b) Include the characters for spacing as well as all punctuation, but not line breaks. (c) You should not make encoding for characters not found in the source text, and I will not use any such characters while testing your code. (d) Weight should be based on the frequency of occurrence and the order in which a node is encoun tered. That is, f 'e' and have the same frequeney, but 'e' occurs first, its weight would be considered greater. 'weigh' more than something with the same weight that is already on the priority queue on the left, the other node on the right. java Huffman (e) When merging nodes, the new weight should be the sum of the previous weights but it should (f) When merging nodes, lesser nodes (by weight, and then if there is a tie, by occurrence) should be