Question $2$

$($a$)$ Complete the diagram on the second provided page to demonstrate how Dijkstra's algorithm

would find the shortest path from node B to all other nodes. Use the notation demonstrated in

the lectures, indicating:

The estimated shortest distance to a vertex

Whether a node's shortest distance is known

The predecessor of the vertex on the shortest path from B

$($b$)$ Use the information in the table to describe all the nodes on the shortest path from B to F$.$