3. Consider the network below, where each link has a cost of 1 Assume node A is the only destination, and nodes calculate the shortest paths using the Bellman-Ford algorithm. The initial routing tables at each node are illustrated in the table below. (DA(A),HA(A) (DB(A), HB(A)) (Dc(A), Hc(A)) (Dp(A), HD(A) (2,B) (3.C) (0,A) (i) Assume link BA goes down and B finds out about this failure. Wire down the first ferw iterations by adding
OR
OR