Show that there exists a non-regular language that satisfies the pumping lemma. In particular, you can consider the following language. L = {(ab^n)(c^n) : n >= 0} U { (a^i)(b^j)(c^k) : 1; i; j; k >=0} You need to show that (1) L is not regular, and (2) L satisfies the pumping lemma.