The following network diagram represents a minimum cost transshipment problem.

Assume that $x_{-}IJ$ is represents the quantity shipped from node I to node J$.$

Which of the following statements are true for this problem?

There is a decision variable that appears in more than two constraints in this problem's algebraic

formulation, not including non$-$negativity constraints.

At the optimal solution, the constraint at Node A will be binding.

At the optimal solution, the constraint at Node B will be non$-$binding, that is it will have non$-$zero

slack.

This problem has a feasible solution when the requirement at Node D is increased by $15$ units to $30.$

None of the answers are correct.