plz need answers for both questions 2 & 3

Problem #2 A text files with seven symbols {A, B, C, D, E, F, G} 150 Symbol Count A 100 B 120 D 30 E 40 F 130 G 10 1. Apply the Huffman algorithm to find the Huffman tree 2. Find the code for each symbol 3. Final the subtotal (bits) for each symbol Problem #3 Suppose a text file with four symbols {A, B, C, D) have a total count 5500 symbols. What is the saving space, if the ASCII table (7-bits for each symbol) used and the compressed file size is 10,748 bits