Let F be a language of all strings in $\{0,1\}$

$$ where all pairs of $1$s must be separated by an

even number of symbols. Note that $1001001$ in $/$ F$.$ Give the state diagram of a DFA with five

states that recognizes F$.$