Huffman Coding Problem:

Given a set of symbols and their frequency of usage, find a binary code for each symbol, such that:

a. Binary code for any symbol is not the prefix of the binary code of another symbol.

b. The weighted length of codes for all the symbols (weighted by the usage frequency) is minimized.

Homework Submission:

1. Write-up explaining key implementation characteristics.

2. Numerical results for different input sizes. (Chart that indicates time complexity).

3. Write-up report

**Subject Computer Science Data Structures and Algorithms**