Question 2 Consider the directed network (D, w) with V (D) = {a, b, c, d, e}, A(D) = {ab, ac, ae, bd, cd, ce, ea, eb}, and w A(D) R with = w(ab) 2, w(ac) = 2, w(ae) = 1, w(bd) = 2, w(cd)=1, w(ce) = -3, w(ea) = 1, w(eb) = 1. (b) Use the Bellman-Ford algorithm to find a shortest directed a-d-path in (D, w). Show your working, and give the path and its length.