Consider the language L defined as all palindromes over {a, b, c} that also contain a c precisely in the middle position. (Note all words in L must therefore be of odd-length.) 5. Prove, using the Pumping Lemma for Regular Languages, that L is not regular. 6. Prove that L is context-free by constructing a PDA that accepts L. 7. Prove that L is context-free by constructing a context-free grammar that generates L. Consider the language L defined as all palindromes over {a, b, c} that also contain a c precisely in the middle position. (Note all words in L must therefore be of odd-length.) 5. Prove, using the Pumping Lemma for Regular Languages, that L is not regular. 6. Prove that L is context-free by constructing a PDA that accepts L. 7. Prove that L is context-free by constructing a context-free grammar that generates L