Consider the following flow network. S 18 12 4 a d f 5 16 Find the maximum flow value. 6 2 b 10 10 e 6.0 g 10 12 8 11 8 C Run the Edmonds-Karp algorithm to find the maximum flow from the sources to the sink t. In each iteration of the algorithm, you need to: Write the BFS path (as list of vertices) from s to t on the residual network Write the residual capacity of that BFS path Draw the updated residual network at the beginning of the next iteration