Consider the following network graph, each node represents a router, and link costs known to

all nodes. By using Dijkstra$$s algorithm find the forwarding table for the node B and show the

iteration steps in table. Note: the graph is directed. Fill in the table, after applying the

algorithm