Game With Demon: The 4 main steps for proving a language L is not regular is as follows:

Step 1: Demon Picks k 1. You are given some pumping length k 1.

Step 2: You pick xyz. Select x, y, z such that xyz L and |y| k.

Step 3: Demon Picks Decomposition u, v, w. The demon picks u, v, w such that y = u, v, w and v !=epsilon.

Step 4: You pick i 0. Construct a string xuviwz that is not in L, for some i 0.

For each of the following languages, identify whether or not it is regular and prove your assertion. When you prove a given language is not regular, use the game with demon Do not apply the Pumping Lemma directly. 2. L = { z E {a,b,c)* | r is a palindrom .)