5.04-1. Bellman Ford Algorithm (1, part 1). Consider the scenario shown below, where at t=1, node e receives distance vectors from neighboring nodes d, b, h and f. The (old) distance vector at e (the...

Extracted text: 5.04-1. Bellman Ford Algorithm (1, part 1). Consider the scenario shown below, where at t=1, node e receives distance vectors from neighboring nodes d, b, h and f. The (old) distance vector at e (the node at the center of the network) is also shown, before receiving the new distance vector from its neighbors. Indicate which of the components of new distance vector at e below have a value of 1 after e has received the distance vectors from its neighbors and updated its own distance vector. [Note: You can find more examples of problems similar to this here. DV in b: D,(a) = 8 Do(f) = 00 Do(c) = 1 Do(g) = 00 Do(d) = 00 Do(h) = 00 Dole) = 1 D,li) = 00 old DV at e at t=1 e receives DV in e: %3D DV in d: DVs from b, d, f, h Dala) = 1 Da(b) = Dalc) = Dald) = 0 Dale) = 1 Df) = 00 Dalg) = 1 Da(h) = 00 Dali) = 00 Dela) = 0 De(b) = 1 Delc) = 00 Deld) = 1 Dele) = 0 Delf) = 1 Delg = De(h) = 1 Deli) = 00 = 00 a. = 00 8 1 Q: what is new Dv computed in e at %3D %3! 1 t=1? = 00 %3D d. compute- 1 f DV in f: DV in h: Dn(a) = 00 Dn(b) = 00 Dn(c): Dn(d) = 0 Dn(e) = 1 Dn(f) = 00 Drlg) = 1 Dn(h) = 0 Dnli) = 1 D{a) = 00 D{b) = DẠC) D(d) = 00 Dle) = 1 D{f) = 0 D(g) = 00 D{h) = 00 D(i) = 1 = 00 = 00 = 00 1 1 g- %3D %3D Dela) De(b) De(c) O De(d) Delf) O Delg) De(h) Del) 1.