(10pts) Given a DFA, M, with alphabet, Σ, and a string s = 818283... 8100 that is in L(M). Prove that if the number of states in M is 10, then there must be a substring between 5.45 and 865 that can be repeated an arbitrary number of times and the so modified string will still be in L(M).