66) Related to the P-NP question is the following property If P ANP, then NP-hard problems are not solvable b IfP NP, all NP-hard problems can be solved very quickly. c.) PaNP is a question of complexity, not solvability d. The P-NP question was first proposed before the construction of the first electric computer. A problem related to P-NP is satisfiability of boolean predicates where each clause in the predicate consists of at most two variables (termed literals in the literature)