Problem $1.$ Consider the minimum cost flow problem shown below, where $$ values $($netflows generated$)$ are given by the nodes, the $$ values $($costs per unit value$)$ are given by thearcs, and the $$ values $($arc capacities$)$ are given between nodes $$ and $.$