A student wants to schedule a project using PERT. She has determined the following activities, precedence relationships and time estimates in days for the project. TIME estimate Exp Time Variance Act to tm tp te Vt a 4 6 7 5.83 0.250 b 1 2 3 2.00 0.111 c 5 5 5 5.00 0.000 d 7 9 12 9.17 0.694 e 2 4 8 4.33 1.000 f 6 9 10 8.67 0.444 1. Name all potential paths and their path durations. 2. Calculate ES, EF, LS, LF, and slack for all activities. 3. How many days can activity "c" be delayed without extending project duration?   A company has developed a project and wants to accelerate (crash) the schedule if possible. Below network diagram and table show all information needed. Dotted arrow represents a “dummy” = no activity, but precedence. Partial crashing is available. 4. For the network, how many potential paths exist? 5. For present schedule, how long will project take? 6. What activity should be crashed first to accelerate the project by 1 day? 7. What activity should be crashed next to accelerate the project by another day? 8. What is the completely accelerated project duration after maximum crashing? 9. What is the total additional cost for reducing the duration by the maximum?