Problem 1. (100pts) In this problem, you are asked to source encode the following sequence of bits to decrease the bit rate. {0101101110111101111101111110111110011110} a) Compress this sequence using Lempel-Ziv coding. Create the dictionary, and find the resulting com- pressed bit sequence. What is the compression ratio (number of compressed bitsumber of uncom- pressed bits)? b) Compress this sequence by Huffman coding instead. To do this, assume that you divide your sequence into 2-bit symbols (i.e., 00, 01, 10, 11), and find the frequency of occurence of each 2-bit symbol. Use these frequencies as the prior probability of each symbol, to find your codebook. Find the resulting compressed sequence. What is the compression ratio? Problem 1. (100pts) In this problem, you are asked to source encode the following sequence of bits to decrease the bit rate. {0101101110111101111101111110111110011110} a) Compress this sequence using Lempel-Ziv coding. Create the dictionary, and find the resulting com- pressed bit sequence. What is the compression ratio (number of compressed bitsumber of uncom- pressed bits)? b) Compress this sequence by Huffman coding instead. To do this, assume that you divide your sequence into 2-bit symbols (i.e., 00, 01, 10, 11), and find the frequency of occurence of each 2-bit symbol. Use these frequencies as the prior probability of each symbol, to find your codebook. Find the resulting compressed sequence. What is the compression ratio