Problem $3$:

Completely crash the following network schedule using complex compression, and find the optimum time and least cost. Draw the cost vs$.$ time curve.

$\backslash$table$[[$Activity$,$Duration,Cost, $$],[$Normal$,$Crash,Normal,Crash $1,$Crash $2,$Crash $3,$Crash $4,],[$A$,6,4,800,865,940,,,],[$B$,12,8,1100,1170,1255,1350,1455,],[$C$,10,6,1400,1475,1565,1665,1785,],[$D$,8,5,1000,1035,1115,1215,,],[$E$,6,4,900,985,1125,,,],[$F$,4,3,800,840,,,,]]$

Overhead Costs $=$$$\frac{30}{?}$ day

$3$