now do the following remove two trees from the priority queueand make them into children of new node the new node has frequency that is the sum of the children' frequenciesits character field can be left blank insert this new three-node tree back into the priority queue keep repeating steps and the trees will get larger and largerand there will be fewer and fewer of them when there is only one tree left in the queueit is the huffman tree and you're done figures and show how the huffman tree is constructed for the susie message alf bt sp lf sp sp lf figure growing the huffman treepart lf sp sp lf