Consider the k-SAT problem. Select all which are true: Each literal may appear in at most k clauses The 2SAT problem may be solved in polynomial time In the graph of implications, the vertices represent the literals In the graph of implications, the vertices represent the clauses