### Determine which of the given strings are recognized by the given deterministic finite-state automaton.

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