bLet M be a DFA with n states. Prove that strings in L$($M$)$ whose length is greater than n

must contain a non void sub string that can be removed or repeated any number of times and the

string will still be in L$($M