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?
How $(B)$ is false$?$
$L_1$ is regular $\implies$ ( it is recursive AND it is also recursively enumerable.) i.e. $REC\ and \ RE$
$L_3$ is not recursive AND it is recursively enumerable. i.e. $(\sim REC)\ and \ RE$
$L_1 \cap L_2 = $ common part of both $L_1$ and $L_3 = RE$
"L1∩L2 will be REL" but not recursive
for option D. Recursive language is REL too
Refund time depends on the payment mode --...