Consider a project having the following six activities: Activity Intermediate Predecessors Time $($weeks$)$ Max Cr Crash cost per week A; C$,$ E; $4$; $2$; $$2000$; B; $$ A; $6$; $2$; $$1000$; C; $$ G; $6$; $6$; N$/$A; D; $$ C; $3$; $2$; $$1000$; E; $$ G; $5$; $2$; $$500$; F; A$,$ D; $5$; $2$; $$1250$; G; none; $5$; $2$; $$2250*$Shortest possible time for the task A$.)$ Draw the project network and list the earliest start $($ES$),$ earliest finish $($EF$),$ latest start $($LS$)$ and latest finish $($LF$)$ for each task B$.)$ What is the slack for each activity? A:$\_\_$ B:$\_\_\_$ C: $\_\_\_$D: $\_\_\_$E:$\_\_\_$ F: $\_\_$G:$\_\_\_$ C$.)$ The project needs to be crashed by $2$ weeks.$$ What are the activities crashed to achieve the $2$ week crash at the lowest cost?$$ List the new duration of each crashed task and any associated crash costs. Activity Duration Crash Cost A $??$ B C D E F G D$.)$Draw the NEW project network and list the earliest start $($ES$),$ earliest finish $($EF$),$ latest start $($LS$)$ and latest finish $($LF$)$ for each task List the tasks on the critical path List the new project duration