4 1 4 4 4 4 4 1. Using Huffman code, we can compress the bits used for saving the characters in a file: Table. 1. Characters count. Table 2. Character bit using Huffman code Character Frequency Character Bits Frequency Total E 1 Bits F 1 Space 3 4 12 H 1 A 3 12 M S 3 12 R D 1 2 8 T 1 G 2 8 Y 1 3 12 D 2 L 2 8 G 2 N 4 3 12 L 2 o 4 2 8 0 2 Y 4 1 4 1 3 E 5 1 5 N 3 F 5 1 5 4 H Space 5 1 5 4 M 5 1 5 S 4 R 5 1 5 T 5 1 5 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: ml Input: list of characters such as table 1 > Output: total bits using Huffman code encoding (table 2) > Task: Design an algorithm in pseudocode/code to print the total bits using Huffman code encoding and write down the Algorithm analysis. The complexity of the algorithm must be in Oln) and proof it! > PS: you don't need to sort the input since the input is already sorted! NP: please answer using pseudocode