= 6. a) Use the LZW method to compress the source text S = ABCABCACAB where the source alphabet is = {A,B,C} and the corresponding code numbers are A = 65, B = 66, C = 67. The next new code number your algorithm creates should be 68. Show the coded text using code numbers and give the dictionary D you constructed during encoding. Make sure to show the intermediate steps. b) Suppose the alphabet is = {a,b,c}. Give the string of length 10 for which LZW compression is the worst possible. If there are many strings leading to the worst compression possible, your string should be the smallest according to the lexicographic order. Explain why this string leads to the worst possible compression.