In this question, you need to test the pseudocode from quest…

In this question, you need to test the pseudocode from question five. You will manually simulate the execution of the code step by step until the program completes and outputs the Huffman tree. Please provide the resulting Huffman tree and the corresponding Huffman codes below. As for the representation of the tree, here is an example:            (20)           /    \       (7)            (13)      /   \            /   \    (4)   C(2)   D(6) E(7)    /   \ A(1)  B(3) When generating codes to characters, follow these rules: 1. Traverse the Huffman tree from the root to each leaf node. 2. Assign a ‘0’ for a left edge and a ‘1’ for a right edge. 3. The code for each character is the sequence of bits along the path from the root to its leaf node.