Show the execution of the Edmonds-Karp algorithm on the flow network of Figure 26.1(a). A flow network G = (V, E) for the Lucky Puck Company's trucking problem. The Vancouver factory is the source s, and the Winnipeg warehouse is the sink t. The company ships pucks through intermediate cities, but only c(u, v) crates per day can go from city u to city v. Each edge is labeled with its capacity. (b) A flow f in G with value |f| = 19. Each edge (u, v) is labeled by f(u, v)/c(u, v). The slash notation merely separates the flow and capacity; it does not indicate division