Data communication and networking

1. Suppose that 6 routers (u, v, w, x, y and z) are connected as follows with the cost of each link shown next to it 4 a) Use Dijkstra's algorithm to compute the least cost path from Router u to all other routers in the network. (8 points) o) Construct he Shorest palin graph Tron other routers from your solution in Part a. (4 points) c) Find the routing table of Router u from your solution in Part b. (3 points)