1. (a) Encode the following bit pattern using run-length encoding with 4-bit code with the number of zeroes as follows: 20, 13, 55,1,15, 11 (b) Encode the same pattern using run-length coding with 5-bit code. (c) Compare the two codes and comment on two choices. 2. (a) Encode the following pattern using Huffman coding with the given frequencies A(6),B(8),C(15),D(22),E(28),F(13), G(8) (b) Using the Huffman code: A-0, B-10, C-11, (i) Encode the message BAAABBBAAACCA (ii) Decode the message 0101000011110 3. (a) Encode the uncompressed string BAABBABAABBBABBBBAABAAA using Lempel-Ziv coding (b) Decode the compressed string BA1B2A2B4B4A3B5A which was compressed using Lempel-Ziv coding method (dictionary of course not known) 1. (a) Encode the following bit pattern using run-length encoding with 4-bit code with the number of zeroes as follows: 20, 13, 55,1,15, 11 (b) Encode the same pattern using run-length coding with 5-bit code. (c) Compare the two codes and comment on two choices. 2. (a) Encode the following pattern using Huffman coding with the given frequencies A(6),B(8),C(15),D(22),E(28),F(13), G(8) (b) Using the Huffman code: A-0, B-10, C-11, (i) Encode the message BAAABBBAAACCA (ii) Decode the message 0101000011110 3. (a) Encode the uncompressed string BAABBABAABBBABBBBAABAAA using Lempel-Ziv coding (b) Decode the compressed string BA1B2A2B4B4A3B5A which was compressed using Lempel-Ziv coding method (dictionary of course not known)