Show your knowledge of the Ford-Fulkerson Network Flow Algorithm by carefully carrying out the steps on the graph pictures below. Use the Edmonds-Karp heuristic, in which each augmenting path should use as few edges as possible. Indicate your sequence of steps. Resolve choices by going to lowest numbered correct vertex. State the current flow total after each augmenting path. 14 24/ Show your knowledge of the Ford-Fulkerson Network Flow Algorithm by carefully carrying out the steps on the graph pictures below. Use the Edmonds-Karp heuristic, in which each augmenting path should use as few edges as possible. Indicate your sequence of steps. Resolve choices by going to lowest numbered correct vertex. State the current flow total after each augmenting path. 14 24/