Can u please solve and explain clearly?

Consider a text files with a total of 100 characters consisting of 1. 'e' occurring 42 times 2. 'a' occurring 35 times 3. 'l' occurring 13 times 4. 'o' occurring 6 times 5. 'u' occurring 4 times. We construct the optimal prefix code using Huffman prefix code algorithm covered in class. Which of the following pairs are merged for the first step of the algorithm? ou are merged oi are merged all characters are merged a,e are merged After executing the full prefix tree construction, write down the number of bits in the optimal prefix code obtained? # of bits for 'e': # of bits for 'a: # of bits for i: # of bits for 'o: # of bits for'u': What is the number of bits required to encode the file using the Huffman code? Write down the final answer as a number in the box below