Consider the following types of languages: \(L_1\) : Regular, \(L_2\) :…

Consider the following types of languages: $L_1$ : Regular, $L_2$ : Context-free, $L_3$ : Recursive, $L_4$ : Recursively enumerable. Which of the following is/are TRUE?

I. $\overline L_3 \cup L_4$ is recursively enumerable

II. $\overline L_2 \cup L_3$ is recursive

III. $L_1^* \cap L_2$ is context-free

IV. $L_1 \cup \overline L_2$ is context-free