Problem $9-22($Algorithmic$)$

Consider the following project network and activity times $($in days$).$ Assume that management desires a $12-$day project completion time.

$\backslash$table$[[$Activity$,$A$,$B$,$C$,$D$,$E$,$F$,$G$],[$Time$,2,2,5,5,6,2,2]]$

The crashing data for this project are as follows:

$\backslash$table$[[,$Time $($days$),$Cost $($$$)],[$Activity$,$Normal,Crash,Normal,Crash$],[$A$,2,1,700,1100],[$B$,2,1,1300,1500],[$C$,5,3,2300,3300],[$D$,5,3,1400,2000],[$E$,6,4,1800,3200],[$F$,2,1,700,1000],[$G$,2,1,600,1000]]$

All work saved.