Show that if a DFA accepts a string whose length is greater than or equal to the number of states, then the number of strings accepted by the automaton is infinite.