Let = {a, b, c}. Let L be the language of all words containing any string s of a's and b's followed by a number of c's equal to length(s). L = Prove that L is nonregular by using the first version of the pumping lemma (Theorem 13).

{(a + b)"ch) In > 1} = {ac, bc, aacc, abcc, bacc, bbcc, aaaccc, aabccc, abaccc, ...)