3) Use the Pumping Lemma to prove the nonregularity of thefollowing language: A word may have any number of a’s and b’s inany order, but may (or may not) contain 1 “c”. If it contains a”c”, it must be in the first half of the string (in odd-lengthstrings this means at or before the middle character).
Expert Answer
An answer will be send to you shortly. . . . .