Draw a transition diagram for a deterministic finite-state automaton over Σ = {0, 1} that recognizes any string ending with 111