1. (25) [Minimum cut] Textbook Exercise 1 in Chapter 7. See theinstructions below.
a) For the exercise a, there are multiple minimum s-t cuts.
(i) List all minimum cuts found through examination
(ii) Show the minimum cut found by theFord-Fulkerson algorithm; additionally, show the initial flownetwork (G) and residual graph (Gf) and the final flownetwork (G) and residual graph (Gf).
b) For the exercise b, there is a unique minimum s-t cut. Showthe minimum cut and its capacity found using the Ford-Fulkersonalgorithm; additionally, show the initial flow network (G) andresidual graph (Gf) and the final flow network (G) andthe residual graph (Gf)
Show a
OR
OR