Prove that {aⁿb*cⁿ} is not regular. Hint: Copy the proof of Theorem 11.1only minor alterations are needed.

Theorem 11.1: la"b"g is not regular. Proof: Let M= (Q {a, b}, , q0, F) be any DFA over the alphabet {a, b }; we will show that L(M) dm. consider the behavior of M on an arbitrarily long string of as. As it reads the string, M visits a sequence of states: first *(%-E), then "(%-a), then "(T), aa), and so on. Eventually, since M has only finitely many states, it must revisit a state; that is, there must be some i andj with i