1. Let M be a nondeterministic finite automaton for the set of all binary strings that have either the number of 0's odd, or the number of 1's not a multiple of 3, or both. (a) Define M formally with a clear definitions of the 5-tuple. And define the language A = L(M) as described above. (b) Draw the state diagram of M. (c) Is A the only language M recognise? (d) Give an example string from A and show M accepts that string. (e) Is that possible to describe this language in terms of regular expres- sions? If so, give the expression. If not, prove.