1. Run Dijkstra's algorithm on the following directed graph and show the result of each step. (1) (30 points.) First, using vertex a as the source, show the shortest paths from the source vertex to every other vertex (2) (30 points.) Then, using vertex e as the source, show the shortest paths from the source vertex to every other vertex. 4 2 8 7 4 3 2 1. Run Dijkstra's algorithm on the following directed graph and show the result of each step. (1) (30 points.) First, using vertex a as the source, show the shortest paths from the source vertex to every other vertex (2) (30 points.) Then, using vertex e as the source, show the shortest paths from the source vertex to every other vertex. 4 2 8 7 4 3 2