All parts a,b, & c

PROBLEM The Huffman coding technique for a particular alphabet yields the following set of codewords Character Codeword (a) Check if this code is a prefix-free 0 code 1011 1010 110 100 (b) Draw the tree appropriate for this code. (c) Check if this code satisfies the Kraft-McMillan Inequality