Consider the previous problem and the same figure copied bel…
Consider the previous problem and the same figure copied below. (All link costs in the network have strictly positive values.) Suppose the value of the link cost from Node 1 to Node 3 changes. What kind of change in the value (e.g., greater than x or less than y) would cause Node 1 to have to generate a new minimum-cost path to Node “8” in the next run of the distance vector algorithm? Answer format a) What is the change in the value of the link from node 1 to node 3 would cause a new route calculation at Node 1? The value should be greater than The value should be less than b) How will this impact the minimum cost calculation? Enter impact in one or two sentences: