a) Build the Huffman coding tree and determine the codes for the following set of letters and weights: QZ F M T SO E 2 3 10 11 12 16 20 26 b) What is the worst case number of bits required by the Huffman code for a string of n letters? c) What is the best case number of bits required by the Huffman code for a string of n letters? d) What is the average number of bits required by a character using the Huffman code for this alphabet?