用下表给出的字符集和频度的实际统计数据建立哈夫曼树，并实现以下报文的编码和译码：“THIS PROGRAM IS MY FAVORITE”字符 A B C D E F G H I J K L M 频度 64 13 22 32 103 21 15 47 57 1 5 32 20 字符 N O P Q R S T U V W X Y Z 频度 57 63 15 1 48 51 80 23 8 18 1 16 1-The actual statistics of the character set and the frequency established by the following table shows the Huffman tree, and to achieve the following message encoding and decoding: " THIS PROGRAM IS MY FAVORITE"　character ABCDEFGHIJKLM frequency 641,322,321,032,115 4757153220 characters NOPQRSTUVWXYZ frequency ° 57 ' 6,315,148,518,023,818,116 1