need 2 question answered about Computer networks topic

ACS-3911 Computer NetworksUniversity of Winnipeg. Lecturer: Dr. Beck
Solutions Assignment Sheet #4
Assignment 4.1
Consider the following network. With the indicated link costs, use Dijkstra’s shortest-path algorithm
to compute the shortest path from t to all network nodes. Show how the algorithm works by
computing a table similar to Table 5.1 of the textbook.
Assignment 4.2
Consider the network fragment shown below. Node x has only two attached neighbors, w and y.
Node w has a minimum-cost path to destination node u (not shown) of 5, and node y has a
minimum-cost path to node 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.
Question 1: Give x’s distance vector for destinations w, y, and u.
Question 2: 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.
Question 3: 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.