blems.

$\backslash$table$[[$Activity$,\backslash$table$[[$Normal$],[$Time$($weeks$)]],\backslash$table$[[$Normal$],[$Cost $($$$)]],\backslash$table$[[$Crash$],[$Time$],[($weeks$)]],\backslash$table$[[$Crash$],[$Cost $($$$)]],\backslash$table$[[$Maximum$],[$weeks$],[$Reduced$]],\backslash$table$[[$Crash$],[$Cost per$],[$Week $($$$)]]],[$A$,4,550,3,950,2,450],[$B$,5,650,4,750,2,150],[$C$,7,850,4,1350,4,550],[$D$,7,1550,5,2200,3,100],[$E$,7,1800,5,2300,3,550],[$F$,6,250,6,1250,1,1050],[$G$,8,1550,6,1850,3,350]]$

Table $1$

Using the information given.

Calculate the completion time of the project.

Identify the activities on the critical path.

Using the information given and the project completion time calculated in Problem $1,$ reduce the completion time of the project $3$ weeks in the most economical way.

Using the information given and the project completion time calculated in Problem $1.$ calculate the minimum time for completing the project possible.