Go through Dijkstra's algorithm by hand for this graph:

Give the shortest path from a to each other vertex, along with the length of that path.

List your results in the order in which Dijkstra's algorithm finds them.