Problem

In the following network, derive and draw the minimum cost path

trees rooted from nodes $C$ and $F$ 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.