Q. Let L1 be a recursive language, and let L2 be a recursively enumerable but not a recursive language. Which one of the following is TRUE? (Solved)
1. L1' is recursive and L2' is recursively enumerable
2. L1' is recursive and L2' is not recursively enumerable
3. L1' and L2' are recursively enumerable
4. L1' is recursively enumerable and L2' is recursive
- b. L1' is recursive and L2' is not recursively enumerable