4) Consider the network flow graph below, where each arc is labeled with the maximum capacity of that link in the flow network. A 25C 15 - 10,- -* YD 15 35 20 40 10 X 2 (a) Use the Ford-Fulkerson Algorithm to determine the maximum total flow from source to sink in this network. Start with the path s B DA Ct and list (in order) the remaining paths added and the total flow after each path is added. (b) Compute the flows across the cut line (---) shown above on the graph, determining the total flow from S? T, the total flow from T? S, and the net flow. (c) Use the max-flow-min-cut theorem to determine the maximum possible flow through this network. Hint: Consider the arcs where the actual flow is equal to the link capacity