The following is a graph of a linear programming problem. The feasible solution space is shaded, and the optimal solution is at the point labeled Z$*.$

The constraint AJ:

Question $7$ options:

does not contain feasible points.

is a binding constraint.

contains the optimal solution.

has no surplus.