Q. 52 Consider the following languages over the alphabet ∑= {a,b,c}. Let L1 = {an bncm | m, n >= 0 } and L2 = {ambncn| m, n >= 0}.
Which of the following are context-free languages ?
I. L1 ∪ L2
II. L1 ∩ L2
(A) I only
(B) II only
(C) I and II
(D) Neither I nor II
Answer: (A)
Explanation: