Let L = L1 ∩ L2, where L1 and L2 are languages as defined below. Then L is?

• A. Not recursive
• B. Regular
• C. Context free but not regular
• D. None of the mentionedView Answer