Consider running Bellman-Ford on the graph below using node u as the source. You may assume that produces edges in the following order: (u,c),(a,b),(a,d),(u,a),(b,e),(c,d),(e,b),(d,e) Q4.1 1 Point After two iterations of the outer for-loop, what is the estimated shortest path distance for node b ? Q4.2 1 Point How many iterations does the outer for-loop take? The algorithm includes early stopping. Q4.3 1 Point Now, if produces edges produce in a different order: (a,b),(a,d),(b,e),(c,d),(d,e),(e,b),(u,a),(u,c) How many iterations does the outer for-loop take? The algorithm includes early stopping