COMPUTER NETWORKS

7. Consider the network fragment shown below. x has only two attached neighbors, w and y.w has a minimum-cost path to destination u (not shown) of 5, and y has a minimum-cost path to u of 6 . The complete paths from w and y to u (and between w and y ) are not shown. All link costs in the network have strictly positive integer values. a. Give x 's distance vector for destinations w,y, and u. b. Give a link-cost change for either c(x,w) or c(x,y) such that x will inform its neighbors of a new minimum-cost path to u as a result of executing the distance-vector algorithm. c. Give a link-cost change for either c(x,w) or c(x,y) such that x will not inform its neighbors of a new minimum-cost path to u as a result of executing the distance-vector algorithm