This question is asking to proof using Pumping Lemma from Automata theory.

Please do not copy previous existing answers.

Please use this outline to answer this question.

Outline of a pumping lemma proof to show the non-regularity of some language A:

Step 1: Assume A is regular. Therefore (by the Pumping Lemma) there exists some number N, which is the "pumping length".

Step 2: Choose a specific string w such that w?A and |w|>=N. Both of these conditions must be explicitly verified for w.

Step 3: Consider an arbitrary factorization of w into xyz such that |y|>=1 and |xy|

Step 4: Create the string w' from w by choosing some value for i>=0. That is, w' = xyiz for some i>=0. Show that w'element of A, no matter how the portions x, y, and z are determined.

Step 5: Conclude that A is not regular since it does not satisfy the Pumping Lemma.

Problem #1: These are short answer questions concerning the pumping lemma for regular sets. Assume that we are in the middle of a pumping lemma proof designeed to show that a language is not regular, and that the value "N" and all other preliminaries have been determined. The questions below address specifically the "w" string, chosen in Step 2 of the proof, and the "i" value, chosen in Step 4 of the proof a) Let L -101'ok | i.j.k> 0 and i