Consider the following project network, where the number over each node is the time required for the corresponding activity. Consider the problem of finding the longest path (the largest total time) through this network from start to finish, since the longest path is the critical path. (a) What are the stages and states for the dynamic programming formulation of this problem? (b) Use dynamic programming to solve this problem

*Please do not reupload current solution on chegg it is incorrect.