(I) State the pumping lemma with all its conditions and indicate how you go about proving that a language is not regular. (II) If the languages are regular, give an automaton. Otherwise, show it is...

(I) State the pumping lemma with all its conditions and indicate how you go about

proving that a language is not regular.

(II) If the languages are regular, give an automaton. Otherwise, show it is not

regular by using pumping lemma.