x
9
4
w
z
5
3
11
y
3. Given the 4-node topology in Problem #2, do the following.
(a) Give a link-cost change for either $c(w, x)$ or $c(w, y)$ such that $w$ will inform its neighbors of a
new minimum-cost path to $z$ as a result of executing the distance-vector algorithm.
(b) Give a link-cost change for either $c(w, x)$ or $c(w, y)$ such that $w$ will not inform its neighbors
of a new minimum-cost path to $z$ as a result of executing the distance-vector algorithm.
