Objective: The objective of this assignment is to deepen your understanding of Huffman coding by implementing the algorithm, analyzing its efficiency, and exploring its applications in data

compression.

Assignment Task:

Implementation: Implement the Huffman coding algorithm in a programming language of your choice. Your implementation should be able to encode a given input text into a binary string using

Huffman codes and decode the binary string back into the original text.

Test Cases: Develop a set of test cases to validate your implementation. These test cases should cover different scenarios, including texts with varying lengths and frequencies of characters.

Submission Guidelines:

Submit your implementation code along with a brief README file providing instructions on how to compile$/$run your code.

Include a report documenting your theoretical analysis, test cases, experimental results, and discussions on real$-$world applications.

Note:

You are encouraged to collaborate with your peers for discussions and sharing insights. However, each student must submit their own implementation and report.

Make sure to cite any external sources used for reference or inspiration.

Plagiarism will not be tolerated.