Let L be regular language and R be turing recognizable but not accepting language. How many of the following is possible.?
1.compliment of R can be Turing recognizable.
2.L U (R)' can be recursive.
3.set of strings common in R and L can be in not RE.
4.L U R can be recursive.
5.set of strings common in R' and L can be recursive.