This is Introduction of Computation.

Please show complete steps.

This question is about Pumping Lemma.

2. Determine whether or not the following languages are regular. If the language is regular then give an NFA or regular expression for the language. Otherwise, use the pumping lemma for regular languages to prove the language is not regular. (4pts each) 2) L= { 0n : n-2k f or sone k> 1) 3) L={0n : n=2k for some k >1) 2 n 5) L = { w I w : {0, 1 }, no(w) > ni(w) }