Algorithms

Information to be transmitted over the internet contains the following characters with their associated frequencies as shown in the following table: character A E L N O s T frequency 45 65 13 45 18 22 53 on a) Build the Huffman code tree for the message and find the codeword for each character. What is the total number of bits to be transmitted? b) Show that your Huffman code is a prefix code. c) What is the percentage of saving that Huffman code can provide if the data is sent with 8-bit ASCII values without compression? d) Do you always achieve data compression with Huffman goding? Explain