The answer provided on here was wrong. Please help me understand this and show the correct answer.
Exercise 1 (50 points):
Run the Bellman-Ford algorithm on the directed graph of Figure 1.1, using vertex t as the source. In each pass, relax edges in the order provided on Figure 1.2, and using the style/format of Figure 24.4 (Textbook), show the d and Tt values after each pass. It is okay to draw the graphs by hand, take picture(s), and insert them as long as they are neat (neatness is worth 15%).
5
2
8
4
9
Figure 1.1: Graph
t, x, t, y, t, z, (x, t, y, x, (y, z, z, x, z, s, s, t, s, y)
Figure 1.2: Edges Order