Question :
Suppose that 2n letters each have the same frequency k . Describe an optimal Huffman code, justifying your answer with Huffman's algorithm.
In addition, describe its tree, compute the total number of bits required, and compute its compression ratio versus a fixed length code.