2 Problem Network (the Crashing based problem) Hint: There are FOUR paths in this network (I am giving this information so that you minimize your errors). B(8) A(5) C(7) F4 G(12) H(5) E (11) L(3) 1 (6) END > (9) KO) M(12) 0(8) N(9) A construction project has a deadline of 25 weeks. And there is a penalty of $45,000 for every week the project is delayed after the 25 weeks. The activities in the project, their sequence relationships, and their expected normal times are shown in the network. The activities, their expected normal times, and their crash costs are shown in the table below: Note: There are 4 paths in this network (posted on Canvas as a separate file) Crash Costs ($000) Activity Normal 1" 294 week week S14 24 30 11 30 11 S22 25 30 18 31 24 Time 5 8 7 4 11 4 12 S 6 9 1 3 12 9 - COWO-UZZO H 40 10 7 40 3 2 26 11 8 6 14 15 13 11 15 (a) Determine the minimum cost crashing plan to minimize the penalty. List (in the correct ordero all the activities that will be selected in this plan. Obviously, you will continue to crash as long as the weekly crash costs are less than the weekly penalty. (b) Determine the total savings for the above case: Hint for (b): For example, if you are spending $10,000 to crash a project by one week, and if your penalty is $45,000 for one week, then your savings are $35,000 for that week