Consider the following flow network. SK 94 84 74 de A 104 114 54 b+ 10 et 134 ge 10+ 94 74 84 124 K Run the Edmonds-Karp algorithm to find the maximum flow from the sources to the sink t. In each iteration of the algorithm, do the followings: < - Write the BFS path (as list of vertices) from s tot on the residual network Write the residual capacity of that BFS path - Draw the updated residual network at the beginning of the next iteration Find the maximum flow value.