Problem 4:(20 points, 10 points each) Routing algorithm 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 5. 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 Also, assume that the distance-vector routing algorithm is being used by routers W- 2 X Give x's distance vector (D*(w), D^(y), D*(u)) for destinations w, y, and u. In other words, minimum distances to w, y, and u from x Answer: a Give link-cost changes for either c(x, w) or c(x, y) such that x will inform its neighbors of a new minimum-cost b) path to u as a result of exccuting the distance-vector algorithm. You should explain your answer. Please don't just give answer. Answer: