(1) Using the Frequency_Table and a priority queue implemented by a minimum heap, construct your Huffman Tree.

(2) Store the binary code-word of each character generated from the above Huffman tree in the Huffman_Table, and print this Huffman_Table in the same output file output.

(3) Draw the above Huffman Tree manually or using the graphic software. Insert (or save) its image in the file huffman-image.

This below is the Frequency_table being used CR (is the character return key). The progam also needs to take the bottom table from an input.txt file. (needs to be done in java)

1 Below is the Frequency_Table 3 CR 63 4 A 3 5 B 5 8 G 2 9H 1 10 I1 12 M 2 13 N 14 S 2 15 T 16 W 1 17Y 18 19 a 100 2 b 22 21 c 29 22 d 50 23 e 184 24 f 41 25 g 21 26 h 69 27i 105 28 j 29 k7 268 | 68 31, 15 32 m 21 33 n 95 I. 23 35 o 107 36 p 23 37 q 1 38 r 105 39 s 104 41 u 56 12 v 19 43 w 21 44 x 3 45 y 44 1 Below is the Frequency_Table 3 CR 63 4 A 3 5 B 5 8 G 2 9H 1 10 I1 12 M 2 13 N 14 S 2 15 T 16 W 1 17Y 18 19 a 100 2 b 22 21 c 29 22 d 50 23 e 184 24 f 41 25 g 21 26 h 69 27i 105 28 j 29 k7 268 | 68 31, 15 32 m 21 33 n 95 I. 23 35 o 107 36 p 23 37 q 1 38 r 105 39 s 104 41 u 56 12 v 19 43 w 21 44 x 3 45 y 44