Case: Each question is worth 25%. 1. Using Huffman code, we can compress the bits used for saving the characters in a file: Table 1. Characters count. Character Frequency E 1 F H 1 1 1 M 1 R T Y 1 1 2 D Table 2. Character bit using Huffman code Character Bits Frequency Total Bits Space 3 4 12 A 3 4 12 S 3 4 12 D 4 2 8 G 4 2 8 ! 4 3 12 L 4 2 8 N 4 3 12 0 4 2 8 Y 4 1 4 E 5 1 5 F 5 1 5 H 5 1 5 M 5 1 5 R 5 1 5 T 5 1 5 G 2 L 0 2 2 3 3 1 N Space A 4 4 S 4 Total: 126 Total bits used for saving the character in table 1 is 264 bits using standard ASCII 8 bits for 1 character. Using Huffman code encoding in Table 2, the total bits used is 126 bits. The problem: Case: Each question is worth 25%. 1. Using Huffman code, we can compress the bits used for saving the characters in a file: Table 1. Characters count. Character Frequency E 1 F H 1 1 1 M 1 R T Y 1 1 2 D Table 2. Character bit using Huffman code Character Bits Frequency Total Bits Space 3 4 12 A 3 4 12 S 3 4 12 D 4 2 8 G 4 2 8 ! 4 3 12 L 4 2 8 N 4 3 12 0 4 2 8 Y 4 1 4 E 5 1 5 F 5 1 5 H 5 1 5 M 5 1 5 R 5 1 5 T 5 1 5 G 2 L 0 2 2 3 3 1 N Space A 4 4 S 4 Total: 126 Total bits used for saving the character in table 1 is 264 bits using standard ASCII 8 bits for 1 character. Using Huffman code encoding in Table 2, the total bits used is 126 bits. The