The Bellman$-$Ford algorithm is run to find the shortest path from the start vertex $A$ to each vertex

in the following graph. Assume each loop of the algorithm visits vertices in the graph in the

following order: A$,$ B$,$ C$,$ D$.$

How many main loop iterations are executed?

After the first iteration:

A$\text{'}$s distance and predecessor are: $0$ and null

B$\text{'}$s distance and predecessor are: $2$ and A

C$\text{'}$s distance and predecessor are:

Enter inf for $.$

D$\text{'}$s distance and predecessor are: