Input to the compress is a text le with arbitrary size, but for this assignment we will assume that the data structure of the file fits in the main memory of a computer. Output of the program is a compressed representation of the original file. You will have to save the codetable in the header of the compressed file, so that you can use the codetable for decompressing the compressed file. Input to the decompress is a compressed file, from which the program recovers the original file. For sanity
check, you should have a specific magic word at some position in the header of the compressed file, so that decompress can identify whether the given file is a valid Huffman compressed file. You should pay attention to the following issues:
The file that we will use for testing can be very large, having size in Gigabytes, so make sure that your program is bug-free and it works for large input le.
Write efficient algorithm, we will take off as much as 20 points if we feel that the program is taking unusually long time.
You must make sure that your program runs on a Linux Machine, and identically follows the formatting instructions. For formatting error, as much as 15 points can be taken off .
You must provide a Make file to compile your programs. Also, a README.txt le should be provided that will have the instruction to compile and run the programs.