Suppose Dijkstra's algorithm is run on the following graph, starting at node $A.$

$($a$)$ Draw a table showing the intermediate distance values of all the nodes at each iteration of the

algorithm. $(5$ points$)$

$($b$)$ Draw the shortest path tree. $(5$ points$)$