Q:Question:10. a)Build the Huffman coding tree and determine the codes for the following set of letters and weights: Q Z F M T SO E 23101112162026 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?