Assume that we perform the Bellman$-$Ford algorithm that we discussed in class on the

following graph, with source node $f.$

Relaxing order:

$(a,b),(a,e),(a,s),(e,a),(s,a),(b,e),(c,b),(c,d),(d,e),(f,d),(e,s),(f,e),(s,f)$

Complete the "previous node" and "distance" information after performing the second

iteration of the algorithm by select the correct value for each of them. Note that the

initialization step is not considered as the first iteration.

Note: In the information box at each node, the upper field keeps track of the current

distance, and the lower field keeps track of the predecessor node.