Suppose that a directed graph G has the property that every shortest path from the starting vertex s to every other vertex has at most four edges. What would this fact imply about the running time of the Bellman-Ford algorithm for finding shortest paths starting from s in G?