(a) For a binary source with probabilities p(0)=0.9, p(1)=0.1, design a Huffman code for the source obtained by blocking m bits together, m=1,2 and 3. Plot the average lengths versus m. Comment on your result. Additional hint: Consider the alphabet 'a' and 'b'. Using Huffman on these characters is considered as working on blocks of m=1. Next, working on the alphabet 'aa', 'ab' 'bb' is considered as working on blocks of m=2. Finally, working on the alphabet 'aaa', 'aab'....'bbb' is working on blocks of m=3