Consider the following network graph, each node represents a

router, where the link costs known to all nodes.

By using Dijkstra's algorithm find the forwarding table for the

source node $S,$ and show the iteration steps in

table.