Refer to the previous problem. Suppose that the maximum time listed for each activity is actually its normal completion time. Further assume that the maximum number of crash days per activity and cost per crash day are as follows.

a. Create and solve an LP model to determine the earliest start time (with no crashing) for each activity.
b. Modify your LP model and solve it to determine the latest start time (with no crashing) for each activity.
c. Identify the EST, EFT, LST, LFT, and slack for each activity.
d. What is the critical path?
e. If crashing is allowed, how quickly could the project be completed? What is the optimal cost of completing the project in the least amount of time?
f. What is the optimal cost of completing the project in 320 days?

Co w 0 4 3 4 0 3 5 0 4 3 5 1599068302 hp 0 8 3 4 7 1 3 3 0 6 4 3 8 8 0 2 1 3 6 8 7. 00798450012709004656 ABCDEFGHIJKLMNOPQRSTU