discrete math

transport network

2) Find a maximum flow in the following network N by using the labeling algorithm. Then find the minimum cut value. N = {(1, 2, 5), (1, 3, 6), (2, 3, 2), (2, 4, 3), (2, 5, 4), (3, 5, 3), (4, 5, 1), (4, 6, 4), (4,7,5), (5, 7, 4), (6, 8, 3), (7,8,5)}