Prove or disprove the following statements:
(i) L1 = {0^i1^j | i, j ∈ N} is a regular language.
(ii) L2 = {0^n1^n | n ∈ N} is a regular language.
(iii) For x ∈ {0, 1}*,
• R(x) denotes the string obtained by reversing the
string x.
• C(x) denotes the string obtained by flipping 0 to 1 and 1 to 0 in the string x.
L3 = {x ∈ {0, 1}* | x = R (C (x))} is a regular language.
How to solve this in subjective way..