Give a state diagram for a DFA for the language of binary strings that start or end with $1.$

Note that $"$or$"$ means inclusive or$,$ so strings that start and end with $1$ should also be accepted by the machine.

Hint: The formal definition of a DFA is not needed for this question. Your DFA design skills may benefit from first reminding yourself why the three DFAs discussed in class and reproduced below respectively recognize the languages of strings without Is $($L$1),$ strings that end with $1($L$2),$ and strings without Is or that

end with $1($L$3=$ L$1$ U L$2).$