The pumping lemma says that if M accepts a language L,andifn is the number of states of M, then for every x ∈ L satisfying |x|≥n, .... Show that the statement provides no information if L is finite: If M accepts a f inite language L,andn is the number of states of M, thenL can contain no strings of length n or greater.