Find the maximum st-flow and minimum st-cut in the network shown below using the max-flow min-cut algorithm. Show all working. The current flow in the network is zero, and the capacities are shown as numbers next to the arcs.
20
20
-
20
5
20
5
5
20
20
30
30
e
20
10
20
5
25
21
20
10