Answer:
The longest codeword that could possibly be for "n" symbol is n-1 bits.
Explanation:
From the given information:
Suppose we are to consider a set of frequencies [tex]\mathtt{f_1,f_2,f_3 ...,f_n}[/tex], for which f is a symbol for the length n. Therefore, the longest codeword that could possibly be for "n" symbol is n-1 bits.
However, during the encoding for "n" in conjunction with n-2, then the possibilities for n are; [tex]\mathtt{\dfrac{1}{2}, \dfrac{1}{4}, ... \dfrac{1}{2^{n-2}}}[/tex]
We can conclude that the longest codeword that could possibly be for "n" symbol is n-1 bits.
