Question $2(12)$: Five nodes of a network are connected in a series, i$.$e$.,$ A$-$B$-$C$-$D$-$E$.$ The nodes B$,$ C$,$ D$,$ and E currently have recorded $($not necessarily correct$)$ distances from node A as $3,4,5,4,$ respectively $($in terms of hops$).$ They adjust their distances in synchronized steps according to the Bellman$-$Ford algorithm. What will their distances from node A be in the next step?

$1,2,3,4$

$2,3,3,5$

$1,3,5,4$

$2,3,4,5$

$1,4,5,6$

$2,3,5,6$

$$ None of the above answers is correct.