This is Project Management. Chapter is Project Scheduling. Please show full work with explanation.

This is Solution process. Activity durations are given in part b. LFpDij is LFD.

2. For the activity on arrow network information given below (activity durations are given in the table under part b): 70 a. Compute the earliest event occurrence time (TE;), the latest allowable event occurrence time (TL;), and the event slack (ES;) for all nodes/events. Node TE TL ES 5 10 15 20 25 30 35 40 45 50 55 60 65 70 75 b. Compute the four schedule dates (ESD, EFD, LSD, LFpDs) and the floats (TF, FF) for all activities. Node i Nodej Activity Duration ESD EFD LSD LFD TF FF 10 S 6 15 R 4 10 20 A 1 10 25 E 4 10 30 d1 0 15 30 G 1 15 35 B 5 20 40 d2 0 20 60 L 2 25 40 K 1 25 45 d3 30 45 5 30 50 H 5 35 45 d4 35 55 J 40 65 M 45 65 d5 70 T 2 65 w 2 ble ||2|2|b|b|e|8n|6 NNOWOlulo 45 50 lo 50 55 60 65 70 70 70 75 75 75 d6 N P V x Za> 6 3 2 c. Identify the activities on the critical path and the project duration AOA NETWORK OF ACTIVITIES 2 6 (C,11) (F,6) 1,4) (A,12) 8 (D,14) (G2) (B,16) (3,2) 3 5 (5,9) (1,7) . j TE TL ES TE = earliest event occurrence time TL = latest allowable event occurrence time ES = Event Slack . . AOA - EVENT TIME COMPUTATION - Forward pass computations Number nodes in such a way so that i iand for which all immediately preceding nodes TE are known. If no node is found then Stop. Let P denote the set of arcs ending at node j. 3. Set TE; = maxiep{TE; + tij} 4. Go to 2. = AOA - EVENT TIME COMPUTATION Backward pass computations Let the highest numbered node be labeled fin 1. Assign Tlfin = TEfin 2. Find a node i, i