(Solved) : Bet Thought Done Pumpinglemma3a 10 Points Supposelis Regular Language Letpbe Pumping Lengt Q27892727 . . . .

bet you thought you were done with the pumpinglemma.3a. [10points] SupposeLis a regular language, and letpbe its pumpinglength. Prove thatLis infinite iffLcontains a string whose lengthis?pand<2p.3b. [10 points] We saw in class thatADFAandEDFAaredecidable. Now show thatFDFA=hMi:Mis a DFA andL(M) is finiteisdecidable, by using part 3a. (By the way,the same approach works toshow thatFPDAis decidable, using the pumping lemma forcontext-freelanguages, which we unfortunately didn’t have time to cover thissemester.)