HOMEWORK 2: By inspection, find the minimum cost flow in the transportation network below.

For example, one feasible flow would be x₁₅=4, x₂₄=2, x₂₅=2, x₂₆=1, x₃₅=1 (with the flow in all other arcs equal to zero). The cost of this flow is 4(10)+2(100)+2(100)+1(1000)+1(20). Is this the minimum possible cost, or is there another feasible flow for which the cost is smaller?