Determine whether each of these strings is recognized by the given deterministic finite-state automaton (which is displayed in an attached .doc file):

(a) 010

(b) 1101

(c) 1111110

(d) 010101010

10. Determine whether each of these strings is recognized by the

deterministic finite-state automaton in Figure 1.

010

1101

1111110

010101010