For the following language, identify whether or not it is regular and prove your assertion. When it is not regular, use Game with the Demon. Dont apply the Pumping Lemma directly. L = { x e {a, b, c)" | x is a palindrom. } Games with the Demon Like its regular cousin, the pumping lemma for CFLs is most usefnl in its contrapositive form. In this form, it states that in order to conclude that A is not context-free, it suffices to establish the following property: For all k 2 0, there exists z e A of length at least k such that for all ways of breaking z up into substrings z uvwxy with and |vwxl 0, and lvwl3k 4. You pick i 2 0. If uv'wr'y A, then you win. If you want to show that a given set A is not context-free, it suffices to show that you have a winning strategy in this game; that is, no matter what the demon does in steps 1 and 3, you have moves in steps 2 and 4 that can beat him