M is a Turing Machine that loops forever on some string. Then M is
1→ Recursive Set
2→ Recursively Enumerable Set
3→ Recursively Enumerable Set – Recursive Set
P→ Yes
Q→ No
R→ May or May not be
Options:
A: 1-P, 2-P, 3-Q
B: 1-R, 2-P, 3-R
C: 1-Q, 2-P, 3-P
D: 1-Q, 2-R, 3-Q
