Question $1.$ Given an alphabet of $=\{0,1\},$ give a state diagram for a DFA that recognizes the language

$L=\{lon,0\}.$ This means your machine should accept the empty string $($no characters$),$ the string with a single

$0$ character, and nothing else.