C++ Huffman question

1. Given the letters and frequencies below, draw the Huffman tree and write the Huffman code for each letter. At each step of the Huffman algorithm, always connect the smallest frequency nodeas the left child and the second smallest frequency node as the right child Letter. Freq Code. P 20 Q49 R 13 S 100 T 12 U10 V. 19 W. 55 X.11 Y 40 Zo52 If the beginning of the message was:* RXTWSZv What would the beginning of the encoded message be