a,b Consider the following deterministic finite state machine M b 3 9 a 2 = b 8 Does it contain the minimum number of required states for the target language? Prove your answer using minDFSM (Rich, 2008; page 92) or, as an extra challenge, by finding the number of equivalence classes in L(M).