Answer Happy

4. (20 points) Routing Consider the network in the figure below. The numbers on the links between nodes represent the costs corresponding to these links. Assume that nodes initially know only the cost of adjacent links (link to which they are directly connected). The network runs the distance--- vector algorithm. Assume that the algorithm works in a synchronous manner: In one time---slot, all nodes simultaneously receive distance vectors from their neighbors, compute their new distance vectors, and inform their neighbors if their distance vectors have changed. Fill out the distance tables at node C for each time-slot: A 3 8 F 1 Cost To From A с E F 2 Cost To From A C E F 3 Cost To From A с E F A A A B B B D с C C 2 D D D E 2 E F E F E F B