Problem 2. Conside. type of cost. a graph as shown with the assumption that each edge weight is some (a) What are the stages and states for the dynamic programming formulation of this problem? (b) Use dynamic programming to solve this problem. However, instead of using the usual tables, show your work graphically (similar to Fig. 11.2 on textbook). In particular, start with the given network, write f(s) for each of the nodes. Draw an arrowhead that shows the optimal link to traverse out of each of the latter two nodes. Finally identify the optimal path by following the arrows from node A onward to node G. tables for n = 3, n = 2, and n = 1