Q. 48 Consider the decision problem 2CNFSAT defined as follows:
(A) NP-Complete
(B) solvable in polynomial time by reduction to directed graph reach-ability
(C) solvable in constant time since any input instance is satisfiable
(D) NP-hard, but not NP-complete
Answer: (B)
Explanation:
