Apply the Dijkstras algorithm to find the shortest route and distance from airport 1 to each 8 airports. Please create a table labeled: nodes, shortest routes and distance.

Also the parentheses. ( ,) or [, )

3. What depicted below is a section of the U.S. regional airport network, where the number along each branch connecting two airports represents the flight distance (in 1,000 miles) between them. Apply the Dijkstra's algorithm to find the shortest flight route and the shortest distance from Airport to each of the other eight airports. Be sure to show all the temporary and permanent labels that each node receives in the solution process. 0.48 2 0.48 0.20 0.40 0.60 0.72 0.58 0.92 0.34 0.70 0.64 0.65 7 0.70 0.47