Let A, B, C be recognizable languages over an alphabet Σ, such that A∪B∪C=Σ and A∩B=∅,B∩C=∅,A∩C=∅ then
- Only A is Turing decidable
- Only B is Turing decidable
- Both A and B is Turing decidable
- None of these
-----i think all three can be turing decidable .