Consider the following types of languages:
$\text{L1}:$ Regular,
$\text{L2}:$ Context-free,
$\text{L3}:$ Recursive,
$\text{L4}:$ Recursively enumerable.
Which of the following is/are $\text{TRUE}$ ?
- $\text{L3}’ \cup \text{L4}$ is recursively enumerable
- $\text{L2} \cup \text{L3}$ is recursive
- $\text{L1}^{\ast} \cup \text{L2}$ is context-free
- $\text{L1} \cup \text{L2}’$ is context-free
- $\text{I}$ only
- $\text{I}$ and $\text{III}$ only
- $\text{I}$ and $\text{IV}$ only
- $\text{I, II}$ and $\text{III}$ only