1. Indicate whether each of the following properties is true for every Huffman code.
a. The codewords of the two least frequent symbols have the same length.
b. The codeword's length of a more frequent symbol is always smaller than or equal to the codeword's length of a less frequent one.
2. What is the maximal length of a codeword possible in a Huffman encoding of an alphabet of n symbols?