write all connected edges in sorted order?(like (1,2),)

(a)  

First initial values(iteration1) for Bellman-ford algorithm starting vertex is 1?

(a)  

Find iteration2 values using bellman-ford algorithm?

(a)  

Iteration3 values?

(a)  

Iteration 5 values?

(a)