Below graph set of edges is defined by E = [(0,1),(1,3),(3,4),(0,2),(2,3)].  If you used Bellman-Ford's algorithm using Vertex 0 as source vertex, what is the iteration that changes the path from vertex 0 to vertex 4 to its final value?

A single iteration means a run across all edges.  Assume the first iteration starts at one (1).