5. Recall that, in lossless coding, a Huffman code finds the optimal codeword to assign to a given block of N source symbols. (a) Show that {01, 100, 101, 1110, 1111,0011, 0001} cannot be a Huffman code for any N for any source dis- tribution where every block to be coded has non-zero probability. (b) Show that {01, 10, 110, 111, 001, 0001, 0000, 0010}) cannot be a Huffman code for any N for any source distribution where every block to be coded has non-zero probability.