Consider the language: {0n1n0n1n | n >= 0} Is this a regular language? (yes or no) Is this a context-free language? (yes or no) If this language is context-free, provide a context-free grammar for it. Otherwise, use the pumping lemma for CFL to prove it is not.

{0n1n0n1nn>=0} Is this a regular language? (yes or no) Is this a context-free language? (yes or no) If this language is context-free, provide a context-free grammar for it. Otherwise, use the pumping lemma for CFL to prove it is not