Consider the following languages over the alphabet \(\Sigma = \left \{ a, b, c…

Consider the following languages over the alphabet $\Sigma = \left \{ a, b, c \right \}$. Let $L_{1} = \left \{ a^{n}b^{n}c^{m}\mid m,n \geq 0 \right \}$ and $L_{2} = \left \{ a^{m}b^{n}c^{n}\mid m,n \geq 0 \right \}$.

Which of the following are context-free languages?

I.    $L_{1} \cup L_{2}$

II.    $L_{1} \cap L_{2}$