Consider the diagram below, use Dijkstra’s link-state routing algorithm compute the least cost path from X to all other nodes and show the resulting

Consider the diagram below, use Dijkstra’s link-state routing algorithm compute the least cost path from X to all other nodes and show the resulting forwarding table in x……