06) Related to the P-NP question is the following property If P ANP, then NP-hard problems are not solvable. IfP NP, all NP-hard problems can be solved very quickly. C P-NP is a question of complexity, not solvability. P 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). 67) Which of the following NP-hard problems does not have a known variant that is in P a.) Feedback arc set bNode Cover c. Three-dimensional matching d. Max Cut e. 0/1 Integer Programming