1. Suppose that we wish to partition an undirected graph into two components with the minimum number of arcs between the components. HoW, would you solve this problem?
2. Consider the network shown in Figure 6.22(a) together with the feasible flow x (8iven in the figure.
(a) Specify four s-t cuts in the network, each containing four forward arcs. List the capacity, residual capacity, and the flow across each cut.
(b) Draw the residual network for the network given in Figure 6.22(a) and list four augmenting paths from node s to node t.
