Let Ww W B C Suppose Trying Prove Context Free Language Using Context Free Language Pumpi Q37196812

Let A = {ww | w ∈ {a,b,c}∗}.

Suppose you are trying to prove that A is not a context-freelanguage using the context-free language pumping lemma. Your proofstarts (correctly) like this:

Suppose for a contradiction that A is a context-free language.Let p be the pumping length given by the pumping lemma.

Now you have to choose string s. For each choice of s below,state whether or not this choice of s can be used to finish theproof that A is not a context-free language. If your answer is YESyou do not have to explain anything. If your answer is NO, youshould also briefly

OR

 

OR