Problem 5 In the class, we have shown that L = {any: n > 0} is not regular. Use the pumping lemma to show that L3 = {a"ben : n 2 0, k n) is not regular. Can you prove by a simpler way using homomorphism? Problem 6 satisfies the pumpin can consider the following language You need to show that (1) L is not regular, and (2) L satisfies the pumping lemma