In a road network shown in Figure $4,$ find the shortest paths from nodes $1,3,5,6,7,$ and

$10$ to all other nodes using the Dijkstra algorithm. Note that the network is an undirected

network and the numbers shown on each link represent the cost of traversing that link.

Draw the minimum path trees rooted at these nodes.

Figure $4$ Link$-$Node Diagram for Problem $3$