3. [4+4=8 points] Consider the following binary sequence 11101001100010110100 . Use the Lempel-Ziv algorithm to encode this sequence. Assume that the binary symbols 0 and 1 are already in the codebook. Similar to what you see in slides 32 and 34 of the file "dc_4_source_coding_compression.ppt", show the procedure for Lempel-Ziv a) encoding and b) decoding. [Note: During the decoding process, you will have the last bit which will not be decodable. You may leave that bit " 0 " as it is] An example of Lempel Ziv encoding An exampie or Lemper Liv aecoaing