Just answer question (c).

Figure 3 shows a directed road network with in-between distances marked, of which a bus driver wants to obtain the shortest path to reach the destination at node T and she will start the journey at node S. 2 G 1 3 4 3 7 3 D 3 5 5 3 T B F Figure 2 (a) Based on the Dijkstra's Algorithm, please draw the stepwise table. (b) Indicate all the possible shortest path(s) if there is more than one, and generate the trees to describe the path and minimum total distance for the driver to make that journey. (c) Please briefly describe the interrelationship between minimum cost flow and shortest path method