as soon as possible

Homework 2 (100 Points) Instructions: Complete the following questions. Upload the solutions to the D2 dropbox folder 1. (20 points) Let us consider the Bellman-Ford algorithm for finding the shortest path and generating the routing table in a simple network graph as shown in the following. The number beside each link denotes the distance over the link. In the beginning, every node only knows the distance to its directly connected neighbors. Their distance vector tables are shown in the following Des Next Dist. A A 0 B B 2 S Des Next Dist. A 2 B B 0 C 1 D D 4 Des Next Dist. A A 5 B 1 C 0 D D 6 D Des Next Dist, B B 4 C C 6 D D 0 a) Suppose that at time t, A broadcasts its distance vector to both B and C. At time t1, D broadcasts its distance vector to both Band C. You can think that a distance vector includes the whole distance vector table. Please give out the updated distance vector table of B and Cafter t+1. The update rule for each entry is to see whether a shorter path can be found following the Bellman-Ford equation Des Next Dist. Des Next Dist