Computer Networks

e) Given a network diagram (Fig. 1.) as a graph G=(N,E), where N is the set of routers and E is the set of links, use Dijkstra's link-state routing algorithm to compute the least cost path from node B to all other nodes and show the resulting least-cost-path tree from B. Show all calculations to get full credit. [4]