Huffman Coding Huffman code is a particular type of optimal prefix code that is commonly used for lossless data compression. \"the idea of Huffman coding is quite simple: encode frequently used symbols with fewer bits. Huffman code is produced from the Huffman tree, which is a binary tree. Initially, we extract the frequency [occurrence count] of each symbol from the text le. in each step, we merge two subtrees of the least frequency into a new binary tree, until the final binary tree is constructed. For each symbol, its Huffman code is the path from the root to the symbol node where we encode lefttree as '0' and righttree as '1'. Here is an example of constructing Huffman tree: In this question, given the frequency of each symbol, can you calculate the total weighted length of the Huffman code of all symbols? For example the weighted length ofthe above Huffman tree is: 15 X1+7X3+x 3+>