Run Dijkstra's algorithm on the following graph, with the black vertex as the starting vertex:

$($a$)$ Draw the labels and tree edges on the picture below after processing the first four vertices. Mark which vertices have been processed.

$($b$)$ Draw the labels and tree edges on the picture below after the algorithm finishes, i$.$e$.,$ after processing all of the vertices.