Argue that for the distance-vector- algorithm in Figure 5.6, each value in the distance vector D(x) is non-increasing and will eventually stabilize in a finite number of steps. 

Figure 5.6

Node x table cost to cost to cost to 20 1 2 0 1 y 3 1 0 Node y table cost to cost to cost to Z 00 2 0 1 3 1 0 2 0 1 7 1 0 DO Node z table cost to cost to cost to 2 3 00 2 0 1 2 0 1 00 3 1 0 3 1 0 7 10 Time from from from from from wof from from from