Let ={a,b}, and L be the language of those strings w where the number of a 's is a multiple of 3 , and the number of b 's is a multiple of 3 . (a) Draw a DFA M such that L(M)=L. (b) Explain with words the meaning of each one of the states of your machine M. Let ={a,b}, and L be the language of those strings w where the number of a 's is a multiple of 3 , and the number of b 's is a multiple of 3 . (a) Draw a DFA M such that L(M)=L. (b) Explain with words the meaning of each one of the states of your machine M