Consider an alphabet of a discrete memoryless source having the following source symbols with their.

Consider an alphabet of a discrete memoryless source having the following source symbols with their respective probabilities asSuppose there are 3 number of symbols in an encoding alphabet. (a) Create a Huffman tree following the standard algorithm for the Huffman encoding, and compute the codeword and the respective length of the codewords for each of the given source symbols. (b) Determine the average codeword length. (c) Determine the entropy of the specifi ed discrete memoryless source. (d) Determine the code effi ciency