Operations Management

Please Help With Part D Only. All above is for background info

Immediate Time Required Activity Predecessors (weeks) A Start 3 B Start 4 AB 3 D B S E 4 F DE For the project described by the above table, answer the following questions, For (a) and (b) please add a drawing and calculation in this document (photo may be added if hand drawn). (a) Draw the network diagram. Please add drawing here (photo may be added if hand drawn) Slack: 1 0 Slack: 0 Slack: 0 41 C (6) 4 1 E 14 11 Start Slack: 0 14 F Slack: 0 141 14 End Slack: 0 0 4 B (4) 0 4 slack: 2 4 9 D (5) 11 1114 14 14 (b) Using Earliest Start / Earliest Finish, and Latest Start / Latest Finish, find the critical path. Clearly indicate the sequence of activities on the critical path and compute the length of the critical path. 4 + h - 4 + h 14 (d) Returning to the original project of parts (a) and (b), it has been determined that the task completion times for task C have the following distribution. What are the corresponding critical paths and project completion times for each possible activity C duration time? Probability Critical Path Time Required (weeks) Activity C Duration 0.5 2 3 4 0.2 0.2 0.2 0.2 0.2