Computer network

4. Consider the network fragment shown below fig 2. 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. Give x's distance vector for destinations w, y, and u. 2 5 5 Fig 2 5. Consider the count-to-infinity problem in the distance vector routing. Will the count- to- infinity problem occur if we decrease the cost of a link? Why? How about if we connect two nodes which do not have a link