Consider the 5-node network of routers shown below with the given link costs. Assume the cost is hop count. W X 5 y Write the distance vectors for each of the routers after the Bellman-Ford algorithm has been run (converges) - this means write the shortest distances. For example, for router U the vector is of the form: Du = [Du(u), Du(v), Du(x), Du(w), Du(y)] = [0, 4, 11, 8, 16] a. b. Dv [Dv(u), Dv(v), Dv(x), Dv(w), Dv(y) ] = [ b. Dx = [Dx(u), Dx(v), Dx(x), Dx(w), Dx(y) ] = [ - c. Dw = [Dw(u), Dw(v), Dw(x), Dw(w), Dw(y) ] = [ d. Dy = [Dy(u), Dy(v), Dy(x), Dy(w), Dy(y)] = [ e. What do these vectors represent?