Consider the minimum cost flow problem with nonnegativity constraints given in Fig. 5.20 (supplies and demands are shown next to the nodes, arc costs are immaterial). Find all basic flow vectors and their associated trees. Specify which of these are feasible and which are strongly feasible (the root node is node 1).
