Consider a DMS where output is generated from an alphabet {a,b,c,d,e,f,g,h} with respective with probabilities {0.05, 0.1, 0.25, 0.02, 0.25, 0.03, 0.25, 0.05}.Design a Huffman code and sketch the corresponding coding tree. Explain the codewords for each character in the alphabet.Calculate the average length of the codeword if the Huffman code you generated . Calculate the efficiency of your Huffman code