1.a 2-0,1} for the DFSM M in the diagram below. Complete the characteristic function for L(M): L(M) = { w : , where w is interpreted as a binary number n} . . . For example, if you thought, incorrectly, that the strings in L(M) represent binary numbers that are evenly divisible by 4, the characteristic function for L(M) could be written as: L(M) = { w : n%4=0, where w is interpreted as a binary number n} 1.b List the indistinguishability classes for L(M), showing the class transitions for each symbol in . 1.c Is there a DFSM with fewer states than M that could accept L(M)? Co 92 Jo,a