c) Given graph G = (N,E), where N is the set of routers and E is the set of links. Using Dijkstra's link-state routing algorithm compute the least cost path from node U to all other nodes and show the resulting least-cost-path tree from U. Show all calculations to get full credit. [6] U 2 2 3 3 3 Y D