. A source with the alphabet {0, 1} emits the sequence 0 0 0 1 1 0 0 1 0 1 1 1 0 0 0 1.

a) Based on this information, estimate the entropy of the source

b) Assume that the FLC of 0 is 0 and the FLC of 1 is 1, and encode this sequence using the LZW algorithm.

c) Assume that the encoder always appends a 0 to the left of the input string and encode the given sequence with an alternate run length encoding using Huffman code for the length of a run. For example, for 0000111000001111 the encoder should send 5 3 5 4 (without Huffman coding). However, with Huffman coding the encoder has to encode the sequence 5 3 5 4 using Huffman code.