Consider the network topology in Figure 3 that uses Bellman-Ford algorithm as the Distance Vector routing protocol where each number indicates the cost of using the link. Because this network uses a Distance Vector routing protocol, router A does not have a global view of the network and can only see its immediate neighbors through the links connecting it to them. Therefore, router A can only rely on the routing updates sent to it by its neighbors. At each time ti, router A would receive routing updates from its neighbors about the topology of the network from beyond A's local view. The updates are sent in the following form: "sender node" ["destination node":" total cost to destination node"]. For example, B[C: 5, E: 3] means "node B can reach node C with a total cost of 5 and node E with a total cost of 3". Note how router E exist in the network even though router A cannot see it. At time to, router A has its routing table as shown in Figure 3. At each time ti, re-compute router A's routing table based on the routing updates it receives from its neighbors at time t;. And of course, you should apply the updates on the latest table you computed at time t. Also when you receive an update about a new router that never seen before, it should be added as a new line in the new table. (a) (7 points) t B|C:5, E: 3] (b) (7 points) t2: B|C: 1], C[B: 1, D2, E: 4, F: 5] (c) (7 points) t3: C[D: 1], D[B: 2, C: 1, F: 5] (d) (7 points) t4: DE: 5] (e) (7 points) t5: D[F: 10] Activa To Co A 0 B 5 C 3 D 1 Next 5 Cost Hop 3 A 1 A's current routing table Figure 3: router A at time to