Consider a project having the following six activities: Immediate Max Crash cost Activity Predecessors Time (wseks) Crash A N/A S500 B 3 2 none none A AB CD D D E F 2 $1000 2 2 S1000 $2000 $1250 6 2 Shottest possible time for the 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 stack for each activity! A EOR I 5. The project needs to be crushed by 2 weeks. What are the activities crashed to achieve the 2week crash at lowest cost? Lint the new duration of each task and any associated crush Activitation Cash Con A B D F 6. Draw the NEW project network and let the earliest start (ES) cu finish (En), latest art (S) and latest finish (LI) for 7. Ciut the tasks on the critical path(0.4 p.)