2. [10 pts Consider the network below in which an s-t flow has been computed. The capacity of each edge appears as a label next to the edge, and the numbers in the boxes give the amount of flow sent on each edge. (Edges without numbers in boxes have no flow being sent on them.) 10 10 8 10 What is the value of this flow? Is this a maximum (s, t) flow in the graph? What is the minimum s-t cut in this graph? (It is suggested that you use this problem to practice your understanding of the Ford-Fulkerson algorithm)