Multiple choice The problems 3-SAT and 2-SAT are both in P both NP-complete NP-complete and in P respectively undecidable and NP-complete respectively Reveal answer Fill a bubble to check yourself C Correct answer Explanation 3-SAT is a classic NP-complete problem. 2-SAT can be solved in polynomial time (P) by converting it into an implication graph and checking for strongly connected components.