1. (Bellman-Ford) Consider the following directed graph G(V, E): -5 01 2 02 2 3 U3 05 Compute the shortest s-t path using the Bellman-Ford algorithm. In each iteration, process edges in the following order (s, v), (s, 2), (s, v3), (vi, vA), (v2, vi), (2, V3), (v2,t), (v3, v5), (vA, t), (v5, t). Show the values of MIv] and successor[for av EV at the end of each iteration. How many iterations it takes before the algorithm stops? What is the shortest s -t path