Let L = L₁ \Cap L₂, Where L₁ and L₂

Multiple Choice

Let L = L₁ \cap L₂, where L₁ and L₂ are languages as defined below: L₁ = {a^{m}b^{m}ca^{n}b^{n} | m, n >= 0 } L₂ = {a^{i}b^{j}c^{k} | i, j, k >= 0 } Then L is

A) Not recursive
B) Regular
C) Context free but not regular
D) Recursively enumerable but not context free.