Assume that the shortest distance between nodes a , b , c , and d , to node y and the costs from node x to nodes a, b, c, and d are given below: D ay = 5 D by = 6 D cy = 4 D dy = 3 c xa = 2 c xb = 1 c...

Assume that the shortest distance between nodes
a,
b,
c, and
d, to node
y
and the costs from node x to nodes a, b, c, and d are given below:

What is the shortest distance between node x and node y, D_xy, according to the Bellman-Ford equation?