Run Dijkstra's algorithm on the following graph, starting from vertex A. Whenever there are multiple choices of vertex at the same time, choose the one that is alphabetically first. You are expected...

Extracted text: Run Dijkstra's algorithm on the following graph, starting from vertex A. Whenever there are multiple choices of vertex at the same time, choose the one that is alphabetically first. You are expected to show how you initialize the graph, how you picked a vertex and update the d values at the each, and what is final shortest distance of each vertex from A. B 11 A F E