Show the operation of Dijkstra$$s $($Link State$)$ algorithm for computing the least

cost path from E to all destinations.

b$)$ From these results, show the least cost path from E to A$,$ and briefly describe

$($in a sentence$)$ how you got that answer from your work in part a$).$

c$)$ What are distance vectors in nodes E$,$ D$,$ and C$?$ In one or two sentences,

explain how the least cost path from E to A was determined by E based on

these three distance vectors. Note: you do not have to run the distance vector

algorithm; you should be able to compute distance vectors by inspection.

d$)$ Let us focus again on node E and distance vector routing. Suppose all

distance vectors have been computed in all nodes and now suppose that the

link from E to B goes down. Approximately how many distance vector

messages will be sent by node E as a result of this link going down? Explain

your answer.