A B 1 A B D E 1 2 C D E F G 7 9 2 9 0 1 1 0 1 1 0 2 2 0 1 1 0 ON!!! G 9 Table 2: Are traversing costs in the shortest path problem There is a transportation network formed by the seven nodes A, B, C, -, G. We have no information about the locations of the nodes but we know which connections between which pairs of knots are available. In addition, we are informed about the costs to use these connections. Tab. summarizes these information. The sign *-* indicates that there is no direct connection (are) available. a) Use the Dijkstra-Algorithm to determine a least cost path through the network which originates from node A and terminates in node G. You have to use the tabular representation of the Dijkstra-Algorithm. Fill out the following Tab. 1 Iteration permanently current label values (permanent values are marked by *) labeled node A E G B D F 1 2 3 4 5 6 7 Table 3: Tabular representation of the Dijkstra-Algorithm b) What is the shortest path in this situation? Give the found node sequence. The shortest path is = 5 c) What is the length of the shortest path? The shortest path length is =