1) Problems 6.10a (3 points), 6.12 (6 points), 6.15 (6 points)
2) Apply Dijkstra's algorithm to the following graph and identify the shortest distances from node a. Show the intermediate results after each candidate has been processed. (9 points)
