(c) to your threshold problem 1FCNP…2 of (b).

(e) How do (b), (c), and NP-Completeness of 1FLP…2 (Exercise 14-3

(e)) lead to the conclusion that the threshold version 1FCNP…2 also belongs to NP-Complete.

(f) Explain why

(e) implies the full optimization model (FCNP) is NP-Hard.

(g) What would be the consequences of finding a polynomial-time algorithm for either the full optimization problem or its threshold analog? Explain