7) Distance vector algorithm Consider the network below:

a) What are A, B, C, D, E, and Fs distance vectors? Note: you do not have to run the distance vector algorithm; you should be able to compute the distance vectors by inspection. Recall that a nodes distance vector is the vector of the least cost paths from itself to each of the other nodes in the network. (5 points)

b) Now consider node C. From which other nodes does C receive distance vectors?

c) Consider node C again. Through which neighbor will C route its packets destined to E? Explain how you arrived at your answer, given the distance vectors that C has received from its neighbors.

d) Consider node E. From which other nodes does E receive distance vectors?

e) Consider node E again. Through which neighbor will E route its packets destined to B? Explain how you arrived at your answer, given the distance vectors that E has received from its neighbors.

2