Give state diagrams for three DFAs labeled M$1,$ M$2,$ M$3.$ For M$1,$ give a DFA $($such as the

one from class$)$ that recognizes binary strings that end with one. For M$2,$ give a DFA that recognizes

binary strings with an even number of ones. For M$3,$ give the DFA described by your proof in Question $3$ to

recognize binary strings that end with one and have an even number of ones.