Draw the simulation, dont code.

Consider the problem of finding the length of a "longest" path in a weighted, not necessarily connected, dag. We assume that all weights are positive, and that a "longest" path is a path whose edge weights add up to the maximal possible value. For example, for the following graph, the longest path is of length 15: 6 4 6 d 9 2 :0 9 (h 3 Use a dynamic programming approach to the problem of finding longest path in a weighted dag