Q40MCQ2 marks, −0.67Let L=L1∩L2L = L_1 \cap L_2 L=L1∩L2, where L1L_1L1 and L2L_2L2 are languages as defined below: L1={ambmcanbn∣m,n≥0}L_1= \left \{ a^m b^mca^nb^n \mid m,n \geq 0 \right \}L1={ambmcanbn∣m,n≥0} L2={aibjck∣i,j,k≥0}L_2=\left \{ a^i b^j c^k \mid i,j,k \geq 0 \right \}L2={aibjck∣i,j,k≥0} Then LLL is(A)Not recursive(B)Regular(C)Context free but not regular(D)Recursively enumerable but not context free.Sign in to save attempts.Show answer← PreviousNext →SolutionsDiscussionLoading…Sign in with Google