Q. Consider the following statementsI. Recursive languages are closed under complementationII. Recursively enumerable languages are closed under unionIII. Recursively enumerable languages are closed under complementationWhich of the above statement are TRUE? (Solved)
1. I only
2. I and II
3. I and III
4. II and III
- b. I and II