1) Construct a DFA (deterministic finite automaton) that recognizes the following language of strings over the alphabet {0,1}:

strings that end with the "10" pattern

2) Construct a DFA (deterministic finite automaton) that recognizes the following language of strings over the alphabet {a,b}:

strings containing an even number of a's and an even number of b's (in any order)