The following table shows a possible set of Huffman codes to be used for lossless compression of a text consisting only of the eight letters shown:e        t        o        h        l         p         w         z10       01       111      110      0001      0000      0011      0010The codes will have been chosen by using an algorithm that has as input the frequencies of occurrence of each of the letters in the particular text. The choice of codes can be presented as a Huffman tree. The tree is shown below:                 ()               /    \            ()        ()          /   \      /   \       ()       t  e       ()        /    \              /     \   ()       ()        h          o  / \      /  \p    l    z    wa) Could this tree be extended to include more letters? If not, why not?b) Can you suggest a modification of the tree to include two more letters? 
Can the following Huffman tree be extended to include more letters?
huffman coding