Example 1/11 0/0, 1/10001 3 1/1001 0/1 1/101 0/1 2 0/1 The diagram above denotes the FSC C = (Q,8,v,s), where Q = {0,1,2,3}; 5(7,0) = (2+1)modt for all q E Q; (q, 1) = 0 for all q E Q; 1, if q = 2 v(,0) 10, ifq=3 v(q, 1) = 10^1 for all qe Q. Note that each transition arrow is labeled by b/y, where b is the input bit producing the transition and y is the output string produced by the transition. Intuitively, an FSC compresses an input string w if |C() is significantly less than |wl. Problem 26. (a) Explain why our example FSC is IL. (b) Give an example of an FSC that is not IL