When no solution to the linear programming problem satisfies all the constraints, including the nonnegativity conditions, it is considered
Group of answer choices
A. optimal.
B. feasible.
C. infeasible.
D. semifeasible.