Problem $3$

Use the information contained below to compress one time unit per move using the least cost method. Reduce the schedule until you reach the crash point of the network. For each move identify what activity$($ies$)$ was crashed, the adjusted total cost, and explain your choice if you have to choose between activities that cost the same. Note that there are two missing slopes that you will need to calculate $($D and G$).$