Consider the following languages.
L1 = {0p 1q 0r | p, q, r ≥ 0}
L2 = {0p 1q 0r | p, q, r ≥ 0, p ≠ r}
Which one of the following statements is FALSE?1
L2 is context-free.
2
L1 ∩ L2 is context-free.
3
Complement of L2 is recursive.
4
Complement of L1 is context-free but not regular
5
Question Not Attempted