Describe an algorithm of the Ford-Fulkerson type for checking the feasibility and finding a feasible solution of a minimum cost flow problem (cf., Section 1.2.1). If the supplies si and the arc flow bounds bij and cij are integer, your algorithm should be guaranteed to find an integer feasible solution (assuming at least one feasible solution exists). Hint: Use the conversion to a max-flow problem of Fig. 3.1