6 (5 pts) Given the flow network G and a flow f below Flow f Flow network G complete the next step of the Edmunds-Karp algorithm. Use two colors for Type I and Type II edges bfs on G starting at s Residual network G Determine bfs using a queue: Augmenting flow f Flow f Is the resulting flow a max flow? yes no Show transcribed image text 6 (5 pts)
OR
OR