A modified Huffman algorithm is implemented for compressing sequences of characters from an alphabet of size n, where the characters occur with known frequencies f1, f2, …, fn. The algorithm encodes each character with a variable-length codeword over the values 0, 1, 2 such that no codeword is a prefix of another codeword and so as to obtain the…