Consider a project having the following six activities: Immediate Max Crash cost Activity Predecessors Time (weeks) Crash* per week C, E $2000 A $1000 G N/A C NNNNANN $1000 G $500 A. D $1250 none $2250 *Shortest possible time for the task 1. Draw the project network and list the earliest start (ES), earliest finish (EF), latest start (LS) and latest finish (LF) for each task 2. List the tasks on the critical path 3. What is the expected project duration in weeks? 4. What is the slack for each activity? A: B: C: D: E:_ F : G