(x1 v x2 v x3) ^ (x1' v x3 v x4) ^ (x1' v x3' v x4') ^ (x2' v x3' v x4)
a. Create B. (Construct the graph and specify the appropriate value of k.)
b. Identify a vertex cover C of size at most k for B.
c. From C, determine a satisfying assignment T for A.
(a) For 15 points, show that EVASIVE-PATH is in NP.
(b) For 25 points, provide a reduction of any NP-complete problem to EVASIVE-PATH.