Tessellate S.T.E.M.S. (2019) - Computer Science - College - Set 3 - Objective Problem 1

Consider the following languages $L_1$ and $L_2$ over $\{0, 1\}$ .

• $L_1$ is the language of all strings with an equal number of 0's and 1's.
• $L_2$ is the language generated by the following grammar: $S ::= SS \mid 1S0 \mid 0S1 \mid \epsilon$

Which of the following are correct?

This problem is a part of Tessellate S.T.E.M.S (2019)