Please only use Bellman-Ford equation.

example :-

Q2. Assume that it is known that dD(B)=3 and dC(D)=1. Hence compute the least cost path, dx(y), for each case below, using the distance-vector equation. Show full working. - B-F equation says: du(z)=min{c(u,v)+dv(z),c(u,x+dx(z),c(u,w)+dw(z)}=min{2+5,1+3,5+3}