Consider the network fragment shown below. Switch X has only two attached neighbors, W and Y. Whas a minimum-cost path to destination A (not shown) of 5, and Y has a minimum-cost path to A of 6. The complete paths from W and Yto A (and between W and Y) are not shown. All link costs in the network have strictly positive integer values. 4 a) Give X's distance table (row) entries for destinations W, Y, and A 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 A as a result of executing the distance vector algorithm in the text. 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 A as a result of executing the distance vector algorithm