let 2-cnf-sat be the set of satisfiable boolean formulas in cnf with exactly 2 literals per clause. show that 2-cnf-sat 2 p. make your algorithm as efficient as possible. (hint: observe that x v y is equivalent to ~x -> y. reduce 2-cnf-sat to an efficiently solvable problem on a directed graph.)