Problem1 (a) For the given directed graph first find the maximum flow from S to T by inspection. (b) Show the amount of flow along each edge. (c) Give the residual graph corresponding to the optimal flow. (d) Give the minimum (S,T) cut from this residual graph Show transcribed image text Problem1 (a) For the given directed graph first find the maximum flow from S to T by inspection. (b) Show the amount
OR
OR