Consider the language A_2 {0, 1}* defined as A_2 = {w | there is a position i in w such that the symbol at position i (in w) is 0, and the symbol at position i + 2 is 1.} Prove that any DFA recognizing A_2 has at least 5 states