Let $L_1$ be a regular language, $L_2$ be a deterministic context-free language and $L_3$ a recursively enumerable, but not recursive, language. Which one of the following statements is false?
"L1∩L2 will be REL" but not recursive
for option D. Recursive language is REL too
The answer to the first question is $2048 ...