3. Find the shortest distance path from node A to all other nodes in the network shown below in Figure 1. The link metric shown is for the symmetric cost for each link, i.e., the cost of going from A to B is the same as the cost of going from B to A. Make sure that you show all steps in each algorithm, as done in the class with the table (b) Use Bellman-Ford Algorithm (assuming that update order is B C D E F and back to B, then repeat) 4 Figure 1: Network for Routing Problem 3 4. Here, we consider how the Bellman-Ford algorithm reacts to possible changes in the link cost. In Problem 3(b), after the Bellman-Ford algorithm has converged, what is the distance vector (DV) at nodes A and B? Specifically, write down the DV in the form of Dz :-|D,(A), Dr(B). Dl(C),D,(D), Dr(E), Dl(F)] for x-A and z-B once the algorithm has converged. DA will be directly from your answer to Problem 3(b), while DB can be obtained by just eye-inspection. (No need to run any algorithm or fill in some table to obtain DB.) Now, we consider the following two separate cases: . Case (i): At t0, the link cost I(A, B)4 has changed to (A, B) 10 in Figure 1 . Case (ii: At t 0, the link cost l(A, C) 1 has changed to l(A, C) 30 in Figure 1 For Case (i), does this change in the increased link cost I(A, B) affect other DVs? Explain your logics. What about Case (ii)? Does it result in any change in the DV of other nodes? Show your steps by calculating De as an example and explain how things go there