1. Suppose that 6 routers (u, v, w, x, y and z) are connected as follows with the cost of cach link shown next to it. . a) Use Dikstra's algorithm to compute the least cost path from Router u (8 points) to all other routers in the nctwork. b) Construct the shortest path graph from Router u to all other routers (4 points) from your solution in Part a. c) Find the routing table of Router u from your solution in Part b (3 points DOLL F10 F11 F12 PrtScr Insert F6 F7 F9 5 6 8