9. Let L (0, 1] be the language of all strings such that there exist two Os separated by a number of positions that is a non-zero multiple of 5. For example, the string 1001110 is not in L, but the string 101101101111110 is in L. Intutively, any deterministic finite automaton accepting L must "remember" 5 positions in order to determine the membership of the string this is a general idea but not a proof. Prove that every deterministic finite automaton accepting L must have at least 25 states