a$)$ What are A$,$ B$,$ C$,$ D$,$ E$,$ and F$\text{'}$s distance vectors when the distance vector routing

algorithm converges?

b$)$ Now consider node C$.$ 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.

c$)$ If the link between $B$ and $F$ with a cost of $4$ breaks, how will $B$ and $F$ update their

distance vectors? How many iterations does it take for the algorithm reconverge?

Assume that poisoned reverse is not used.