Code the following steps as they related Huffman code and includes following functions:
I. Input: read a text file consisting of the content to be compressed.
II. Calculate your own statistics for analyzing a file by counting the frequency (how often) each char occurs in the input file. You can treat upper and lower case char the same way so your tree will be smaller and non-alphabet characters.
III. Store each letter and its corresponding frequency in an array of structures.
IV. Sort the information for each letter based on its frequency.
V. Output each letter and its corresponding frequency into a text file.
What to submit:
1. Source code and sample input file ready to run
2. A screen capture of sample input/output
3. Output file
