(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. B D 5 1 Des A Next Dist. A 0 B 2 5 B Des Next A A B B C Des Next Dist. A A 5 B B 1 0 D D 6 Dist. 2. 0 1 4 D Des Next Dist. B B 4 6 B D D 0 UO D in the beginning, every node only knows the distance to its directly connected neighbors. Their distance vector tables are shown in the following. a) Suppose that at time t, A broadcasts its distance vector to both B and C. At time t+1, D broadcasts its distance vector to both B and 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 C after t+1. The update rule for each entry is to see whether a shorter path can be found following the Bellman-Ford equation. B Des Next Dist. Des Next Dist