For each of the following languages, construct a finite automaton (deterministic, nondeterministic, or nondeter-ministic finite automaton with emty-transitions) that accepts the language. Give the key idea(s) for your construction, and brief and precise interpretations for the states of the machine.

(B)

{ x { 0 , 1 } | there exist two 0s in x that are separated by a string of length 5 k for some k0}