Suppose we construct a Huffman tree for an alphabet of n symbols (S1, S2, ..., Sn) such that the relative frequencies of the symbols are 1, 2, 4, ..., 2"-1, respectively.
-Sketch two examples for such tree for n = 4 and n = 8
-In such a tree (for general n > 2), how many bits are required to encode:
- The most frequent symbol Sn?
- The least frequent symbol S1?
- Any symbol Si, i = 2, 3,.., n-1