Q63,p3,d14. According to pumping lemma for context free languages :

Let L be an infinite context free language, then there exists some positive integer m such that any w ∈L with |w |≥m can be decomposed as w = u v xy z

(A) with |vxy|≤m such that uvixyiz∈L for all i = 0, 1, 2

(B) with |vxy|≤m, and |vy|≥1, such that uvixyiz∈L for all i = 0, 1, 2, .......

(C) with |vxy|≥m, and |vy|≤1, such that uvixyiz∈L for all i = 0, 1, 2, .......

(D) with |vxy|≥m, and |vy|≥1, such that uvixyiz∈L for all i = 0, 1, 2, .......

Answer B