Answer Happy

Incorrect Question 17 5.04-3. Bellman Ford Algorithm - a change in DV (1, part 3). Consider the network below, and suppose that at t=0, the link between nodes g and h goes down. And so at t=0, nodes g and h recompute their DVs. Following this recomputation, to which nodes will h send its new distance vector? (Note: to answer this question, you'll need to know some of the DV entries at g and h at t=0, but hopefully they'll be obvious by inspection). Ca 1 d- O all nodes at t=0 the link (with a cost of 6) between nodes g and h goes down 1 compute o 9. Onode i only 8 1 Onode e only 6 nodes i and e only b- 1 1 compute h 1 Onodes i and e and g only 1 1 -c- Not quote. This answer s incorrect. 1 O node h does not send out its distance vector, since none of the least costs have changed to any destination. Si 0/5 pts