Q $1($b$)$

$[15$ Marks$]$

Consider the shortest path problem depicted in the directed network below, where the

starting point is node $1$ and the destination is node $5.$ Demonstrate that such problems

can be solved with Dynamic Programming by identifying the stages, states and

alternatives and performing the calculations at each stage using backward recursion.

NOTE: No marks will be awarded for solving this problem with any other technique

other than Dynamic Programming.