利用最小堆编程实现给定权值集合下构造相应霍夫曼树的算法，并解决以下问题：

有一电文共使用五种字符a,b,c,d,e,其出现频率依次为4,7,5,2,9。

(1)构造对应的编码哈夫曼树(要求左子树根结点的权小于等于右子树根结点的权)。

(2)给出每个字符的哈夫曼编码。

(3)译出编码系列11 00 011 10 00 10 10 11的相应电文。

-With a minimum heap programming under a given set of weights to construct the corresponding Huffman tree algorithm, and address the following issues:

Of a message uses five characters a, b, c, d, e, the frequency of the order of 4,7,5,2,9.

(1) construct the corresponding coding Huffman tree (left sub-tree root node requires less right right right subtree root).

(2) gives each character Huffman coding.

(3) the corresponding series of coded messages translated 110,001,110,001,010 11.