Which of the expressions correctly is an requirement of the pumping lemma for the context free languages?a) uvnwxnyb) uvnwnxnyc) uv2nwx2nyd) All of the mentioned 3.Let L be a CFL. Then there is an integer n so that for any u that belong to language L satisfying|t|>=n, there are strings u, v, w, x, y and z satisfyingt=uvwxy.Let p be the number of variables in CNF form of the context free grammar. The value of n in terms of p :

• A. uvnwxnyb) uvnwnxnyc) uv2nwx2nyd) All of the mentioned 3.Let L be a CFL. Then there is an integer n so that for any u that belong to language L satisfying|t|>=n, there are strings u, v, w, x, y and z satisfyingt=uvwxy.Let p be the number of variables in CNF form of the context free grammar. The value of n in terms of p :a) 2p
• B. uvnwnxnyc) uv2nwx2nyd) All of the mentioned 3.Let L be a CFL. Then there is an integer n so that for any u that belong to language L satisfying|t|>=n, there are strings u, v, w, x, y and z satisfyingt=uvwxy.Let p be the number of variables in CNF form of the context free grammar. The value of n in terms of p :a) 2pb) 2p
• C. uv2nwx2nyd) All of the mentioned 3.Let L be a CFL. Then there is an integer n so that for any u that belong to language L satisfying|t|>=n, there are strings u, v, w, x, y and z satisfyingt=uvwxy.Let p be the number of variables in CNF form of the context free grammar. The value of n in terms of p :a) 2pb) 2pc) 2p+1
• D. All of the mentioned 3.Let L be a CFL. Then there is an integer n so that for any u that belong to language L satisfying|t|>=n, there are strings u, v, w, x, y and z satisfyingt=uvwxy.Let p be the number of variables in CNF form of the context free grammar. The value of n in terms of p :a) 2pb) 2pc) 2p+1d) p2View Answer