a) List all the minimum s-t cuts in the flow network pictured in Figure 1. What is the minimum capacity of an s-t cut in the flow network in Figure 1? What is the value of this flow? Is this a maximum (s,t) flow in this graph? Find a maximum flow from s to t in Figure 2 (draw a picture like Figure 2, and c) d) specify the amount of flow in the box for each edge), and also say what its capacity is. 10 10 Figure 1: Question (a) and (b). The capacity of each edge appears as a label next to the edge. Figure 2: Question (c) and (d). A flow network on which an s-t flow has been computed. The ca- pacity of each edge appears as a label next to the edge, and the numbers in boxes give the amount of flow sent on each edge. (Edges without boxed numbers have no flow being sent on them.) a) List all the minimum s-t cuts in the flow network pictured in Figure 1. What is the minimum capacity of an s-t cut in the flow network in Figure 1? What is the value of this flow? Is this a maximum (s,t) flow in this graph? Find a maximum flow from s to t in Figure 2 (draw a picture like Figure 2, and c) d) specify the amount of flow in the box for each edge), and also say what its capacity is. 10 10 Figure 1: Question (a) and (b). The capacity of each edge appears as a label next to the edge. Figure 2: Question (c) and (d). A flow network on which an s-t flow has been computed. The ca- pacity of each edge appears as a label next to the edge, and the numbers in boxes give the amount of flow sent on each edge. (Edges without boxed numbers have no flow being sent on them.)