Question $12$

$($i$)$ Apply Dijkstra algorithm to compute the shortest path from a node B to all other

nodes in the network shown in Figure $12\mathrm{.}1.$ The numbers on each line shows the cost

of the corresponding line. Show in a table or describe in the text each step undertaken

in the calculations. Show explicitly the obtained routing table which should indicate

the obtained routes and their costs.

Figure $12\mathrm{.}1$