The following graph shows the distances, in miles, on main roads between eight towns A-H. B 8 D 6 F 6 C 11 E 10 G H a. Use Dijkstra's algorithm to find the minimum cost of connecting the cities starting at city A. Use format below to show all iterations: vertex known dv pv ABCDEFGH b. From (a) list the minimum distance and the path for the A-H connection. c. Cars travel on the roads at 30 miles per hour. a. How many minutes will it take to get from A to H? b. A new road is opened from A to D along which cars will be able to travel at 60 miles per hour. The new road will enable the journey time from A to H to be reduced to 36 minutes. What is the length of the new road? Hint: Time from D to H at 30 mph is known, total time is known, speed from A to D is known - determine length.

The following graph shows the distances, in miles, on main roads between eight towns A-H. B 8 D 6 F 6 C 11 E 10 G H a. Use Dijkstra's algorithm to find the minimum cost of connecting the cities starting at city A. Use format below to show all iterations: vertex known dv pv ABCDEFGH b. From (a) list the minimum distance and the path for the A-H connection. c. Cars travel on the roads at 30 miles per hour. a. How many minutes will it take to get from A to H? b. A new road is opened from A to D along which cars will be able to travel at 60 miles per hour. The new road will enable the journey time from A to H to be reduced to 36 minutes. What is the length of the new road? Hint: Time from D to H at 30 mph is known, total time is known, speed from A to D is known - determine length.