Algorithms

Consider a file containing the following characters with their associated frequencies as shown the following table: 'n t' character 'a' frequency 30 's o a b' 40 50 20 50 SO 20 50 25 a) Build the Huffman code tree for the file and find the codeword for each character. What is the total number of bits needed to encode the file? b) Show that your Huffman code is a prefix code. c) Build a fixed length binary code for each character. What is the percentage of saving that Huffman code can provide if the data is sent with your fixed code without compression? d) Do you always achieve data compression with Huffman coding? Explain