I need the answer for a,d and e

2. Create a network diagram using PDM. (1 mark) 5 NODE NAME PREDECESSOR DURATION (days) Early Start (days) Late Start (days) START A START 5 0 B START 4 0 A 3 D A 4 E A 6 F B,C 4 G D H DE 6 F 6 H,G 4 END Based on the information from the table above, fill up each nodes or activity boxes with their Early Start, Late Start, Duration, Early Finish, and Late Finish. And after that: Find the critical path. For example: START-A-B-C-D-END. Critical path is the path or connected line that has the longest total duration. (1 mark) b. What is the duration of the critical path? (1 mark) How many paths are there? (1 mark) d. Calculate the duration of every non-critical path. (1 mark) Calculate the float of every activity (Float = Late Start - Early Start). Remember that the critical path cannot have float. (1 mark) j a. C. e