2. Problem 5-2: Assume that a sample alphabet has the following weights: Letter QZ FM T SO E Frequency 23 10 10 10 15 20 30 For this alphabet, what is the worst-case number of bits required by the Huffman code for a string of n letters? What string(s) have the worst case performance? a) b) For this alphabet, what is the best-case number of bits required by the Huffman code for a string of n letters? What string(s) have the best case performance? c) What is the average number of bits required by a character using the Huffman code for this alphabet