Run Dijkstra's algorithm on the following graph, starting from the left$-$most vertex

marked in black:

To show your work, draw the vertex labels and tree edges

$($a$)$ at the beginning of the algorithm,

$($b$)$ after processing $($i$.$e$.$ relaxing the outgoing edges of$)$ four vertices, and

$($c$)$ at the end of the algorithm.