The following network diagram represents a minimum cost transshipment problem.

qa$\mathrm{.}1-3.$jpg

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?

Group of answer choices

In the optimal solution, at least one node will receive more units than are required at that node.

According to the diagram, the total product demanded is $80.$

Node D will clearly send supply to Node E$.$

Ignoring non$-$negativity constraints, at least two constraints will have non$-$zero slack at the optimal solution.

Exactly two answers are correct.