4. 請利用Bellman-Ford演算法一步一步算出Figure 3從node 1到各點之最短距離。(10%)
(e₁₂=6, e₁₃=5, e₁₄=5, e₂₅=-1, e₃₂=-2, e₃₅=1, e₄₃=-2, e₄₆=-1, e₅₆=2)