Answer:
This is not true
Explanation:
The optimal Huffman code is used to encrypt and compress text files. It uses fixed-length code or variable-length code for encryption and compression of data.
The professor's character code is similar to Huffman's variable-length coding which uses variable length od binary digits to represent the word strings. The file size of the text file above is;
= 6 x 1 + 2 x 2 + 3 x 2 + 2 x 2 + 8 x 1 = 28 bits
This would be the same for both cases.
The encrypt would be the problem as the encoded and decoding of the characters B and E may cause an error.
