Answer

Correct Option: (ii) Pumping

Explanation

Pumping Lemma concept: For regular/CFL languages, any long string $w = xyz$ (with $|y|>0$, $|xy|\le p$) can be pumped: $xy^i z \in L$ for all $i \ge 0$ (repeating $y$ zero, one, or more times).

• Pumping = repeating the middle portion $y$ zero or more times and checking membership.
• Generating is general derivation.
• Producing is vague.

The lemma is used to prove non-regularity/non-CFL by contradiction.

Final Answer

Repeating $y$ is Pumping → Option (ii).