I have no clue how to solve this. Please help

1. Give a formal definition of a DFA M1 using minimum number of states whose language is LI-( w E {0, 1)' : w contains an even number of 0's or exactly two l's) Hint: You can break the problem into two sub-problems and use product construction. 2. Give a formal definition of a DFA M2 using minimum number of states whose language is 2 = {w {0.1,2)* : tv is a ternary representation of an integer that is a multiple of 4} (2) 3. Give a formal definition of a DFA M3 using minimum number of states whose language is L3-(w {a, b)' : u, is any string not in a* U b*) 4. Let F be the language of all strings over [0,1 that do not contain a pair of 1s that are separated by an odd number of symbols. Give the state diagram of a DFA M4 with five states that recognizes F. Hint: You can start with an NFA and then convert it into a DFA 5. Give a state diagram for an NFA M5 with as few states as you can whose language is LA-( w {0, 1.2)" : w is a ternary representation of an integer that is a multiple of 3 but not a multiple of 9) 6. Give an NFA for the set of all binary strings that have either the number of O's odd, or the number of 1's not a multiple of 3, or both