a) Run the Ford Fulkerson algorithm on the following network. For each step of the algorithm, give the augmenting path by listing the vertices on the path and state the amount by which the path increases the current value of the flow. Label each edge of the network with its flow at the end of the execution of the algorithm. State the value of the maximum flow. b) Check if the black vertices {s, a, b, c} form a min-cut. 20 b 16 25