Project: Huffman Coding Huffman coding is a widely used and very effective technique for compressing data; savings of 20% to 90% are typical, depending on the characteristics of the data being compressed. Huffman code is a variable length code whose length depends on the frequencies of characters in a message. It is constructed by building a Huffman Tree based on the frequencies of characters. A binary bit code for each character is determined from the Huffman tree and used to encode a message The Huffman tree is also used to decode an encoded message as it provides a way to determine which bit sequences translate back to a character Write a program which (i) compresses the data of the given message using Huffman code, and then (i) decompresses a compressed file in order to retrieve the original message In this project, your program has to do following tasks action of a Frequency Table of characters/symbols B. Construction of Encoding Tree, i.e. Huffman tree C. Encoding of a message to binary code D. Decoding of the encoded message E. Analysis A. Construction of Frequency Table of characters/symbols: (1) Create an input file 'input' with the poem' Desiderata , written by Max Ehrmann in 1920's . (2). Parse the text of input file, count the frequency of each character/symbol, generate the table of frequencies, and print this Frequency Table into the output file named output NOTE: Every character is case-sensitive, and a space character( ) and carriage-return character (i.e. linefeed, enter) should be also distinguished. B. Construction of Huffman Tree (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'. Project: Huffman Coding Huffman coding is a widely used and very effective technique for compressing data; savings of 20% to 90% are typical, depending on the characteristics of the data being compressed. Huffman code is a variable length code whose length depends on the frequencies of characters in a message. It is constructed by building a Huffman Tree based on the frequencies of characters. A binary bit code for each character is determined from the Huffman tree and used to encode a message The Huffman tree is also used to decode an encoded message as it provides a way to determine which bit sequences translate back to a character Write a program which (i) compresses the data of the given message using Huffman code, and then (i) decompresses a compressed file in order to retrieve the original message In this project, your program has to do following tasks action of a Frequency Table of characters/symbols B. Construction of Encoding Tree, i.e. Huffman tree C. Encoding of a message to binary code D. Decoding of the encoded message E. Analysis A. Construction of Frequency Table of characters/symbols: (1) Create an input file 'input' with the poem' Desiderata , written by Max Ehrmann in 1920's . (2). Parse the text of input file, count the frequency of each character/symbol, generate the table of frequencies, and print this Frequency Table into the output file named output NOTE: Every character is case-sensitive, and a space character( ) and carriage-return character (i.e. linefeed, enter) should be also distinguished. B. Construction of Huffman Tree (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