D Question 17 0-1 Integer Programming is similar to linear programming except the variables can only be O and 1. Consider the 0-1 Integer Programming Decision Problem (0-1 IPD) as defined below: Instance: A set X of 0-1 integer variables (x O or x, 1), a set of inequalities over these variables, a function f(x) to maximize and integer K. Question: Does there exist an assignment of values to X such that all inequalities are true and fx) K? xample -1x2-0, x3 =0} of an instance of 0-1 P-D:x2+ x 3, x-x3 1, fx) 4x1 + X3. K 2. The answer is yes, given certificate (x1 Prove that 0-1 IPD Problem is NP-Complete