QUESTION 1
QUESTION 2
QUESTION 3
QUESTION 4
Suppose now that sometime after the algorithm has converged, the link between e and f goes down. Will node e send out a new DV to its neighbors? Pick a response below that best answers this question.
No. Node e’s distance vector does not change when the link between e and f goes down (since e’s shortest path to f did not use this direct link between e and f), so e will not send out a new DV. 

Yes. Since node e’s distance vector changes when the link between e and f goes down, it will send out a new DV. 

Yes. Node 2 always needs to update all of its neighbors if a alink goes down, since all nodes need to know the network topology. 
QUESTION 5
QUESTION 6
QUESTION 7
5.023. Dijkstra’s Algorithm (2, part 3). Consider the network shown below, and Dijkstra’s linkstate algorithm. Here, we are interested in computing the least cost path from node y (note: not node u!) to all other nodes using Dijkstra’s algorithm. Using the algorithm statement used in the textbook and its visual representation, complete the first row in the table below showing the link state algorithm’s execution by matching the table entries (a), (b), (c), (d), and (e) with their values. Write down your final [correct] answer, as you‘ll need it for the next question. [Note: You can find more examples of problems similar to this here.]

