Consider some text consisting of only $\text{'}$A$\text{'},\text{'}$B$\text{'},\text{'}$C$\text{'},\text{'}$D$\text{'},$ and $\text{'}$E$\text{'}$ characters, and

their frequencies are $15,7,6,6,5,$ respectively. Draw a Huffman code tree

based on the following frequency of characters.