Given an alphabet with n characters. let the characters be numbered from 1 to n, and let the frequency of character i be fi = for i=1, – 1, with the last character n having frequency fn = ns. for example, if n=6, then the frequencies of the first five characters are 1/2, 1/4, 1/8, 1/16, 1/32, respectively, and the frequency of the last character is 1/32. answer the following questions: a) (5 points) show that the frequencies of all characters sum to 1 (as they should) for any n. b) (5 points) show what the huffman encoding is for each character. in building the encoding tree, the larger frequency child should be on the left, and if there are two groups of characters with the same frequency, the one with the smaller index should be on the left. c) (5 points) what is the expected number of bits per character? let the encoding length of character i be denoted as li, then the expected or average number of bits for the encoding is computed as e-li · fi. use this formula to derive an closed form expression (for any n).