Solve #3 and show work please

3.11 PROBLEMS 1. Using Dijkstra's algorithm, find the shortest paths from node a to all other nodes in the 2. Using Dijkstra's algorithm, find the shortest paths from the node 1 to all other nodes in the 3. Consider the traffic network shown in the previous example. The travel demands between node a transportation network shown in Fig. 3.70. transportation network shown in Fig. 3.71 and all other nodes are given in Table 3.14. Assume that the travelers always travel along the shortest path. Calculate the link flows. CHAPTER 3 TRAFFIC AND TRANSPORTATION ANALYSIS 156 FIG. 3.70 Network in which shortest paths from node a to all other nodes should be discovered by Dijkstra's 2 5 6 6 FIG. 3.71 Network in which shortest paths from node 1 to all other nodes should be discovered by Dijkstra's algorithm Table 3.14 The Travel Demands Between Node a and All Other Nodes Pair of Nodes Travel Demand (a,b) (a,c) (a,d) (a.c) (a,f) (a.g) (a,h) 100 50 30 120 40 130 50 60 180 (aj) (a.k)