3. Running Dijkstra's algorithm Submit your answers here: https://canvas.uw.edu/courses/1199402/assignments/4254934 Consider the following graph: 3 10 2 8 4 5 2 Run Dijkstra's algorithm on this graph, starting on node a. Show the final costs of each vertex, as well as the edges that are selected by Dijkstra's algorithm. In the case of a tie, add the vertex that comes first alphabetically