Let the intermediate nodes on the graph of Exercise 1 represent switching locations at a busy train station located at node 5 , to which trains are arriving from node 1.

The edge capacities represent the number of parallel train tracks connecting switching locations. Use the maximal flow algorithm to decide the most efficient way of routing incoming trains. Do this problem by hand, rather than in Mathematica.