3 P2. [2.5 Points] Assume that a binary sequence has been compressed using Lempel-Ziv-Welch coding where the initial dictionary is simply 0 +1, and 1 + 2. The end of file character # is denoted by the 0-th dictionary entry. Determine the original text (sequence of O's and ls) if the encoded version is given by: 1,3,1, 2, 4, 7, 4, 6, 8, 9, 11, 3, 10, 13,0 3 P2. [2.5 Points] Assume that a binary sequence has been compressed using Lempel-Ziv-Welch coding where the initial dictionary is simply 0 +1, and 1 + 2. The end of file character # is denoted by the 0-th dictionary entry. Determine the original text (sequence of O's and ls) if the encoded version is given by: 1,3,1, 2, 4, 7, 4, 6, 8, 9, 11, 3, 10, 13,0