Continue running the Ford-Fulkerson labeling algorithm on the network flow in Figure 13.12 until the algorithm halts without labeling the sink. Find the value of the maximum flow as well as a cut of minimum capacity.

8. Continue running the Ford-Fulkerson labeling algorithm on the network flow in Figure 13.12 until the algorithm halts without labeling the sink. Find the value of the maximum flow as well as a cut of minimum capacity. 24, 12 A 31 4 25 2 17, 17 20, 8 D Figure 13.12. An Updated Network Flow n-context ./knowl fig networkflow updated flow. html