I have found this problem-
let A be the set of encoding of all those Turing machines that accept exactly two strings and let A' be the complement of A. Comment on whether A and A' are recursive , recursively enumerable or not recursively enumerable.
I am clueless at "exactly 2 strings". I have tried many books but I can't solve it. Please help.(Any hint is acceptable)