In the following 2 exercises, use the Pumping Lemma or the closure properties of regular languages to prove that the corresponding languages are not regular.

4. A= {on! | n >=0} (Reminder: n! = 12...n) Solution: 5. C = { 01" m+n} (Note: This is an example where the pumping lemma is difficult to use. It is much easier to use the closure properties of regular languages.) Solution: 4. A= {on! | n >=0} (Reminder: n! = 12...n) Solution: 5. C = { 01" m+n} (Note: This is an example where the pumping lemma is difficult to use. It is much easier to use the closure properties of regular languages.) Solution