Problem 3 Show the trace of the Bellman-Ford algorithm on the following directed graph, using vertex z as the source. In each pass, relax edges in the order of (t, x),(t,y),(t, 2), (2,t), (y,x), (y, z), (, 2), (2,5),(s, t),(s,y). Show the d values after each pass. (A similar trace which starts from vertex s can be found in Figure 24.4 of CLRS, 3rd Ed., but in this homework problem you start from vertex z and also do not need to show the a values.) 2 s 15 12 3 11 y