Please answer only question 1 and 2.

1. Draw a critical path diagram for a project with activities following the precedence relations in the diagram below: You must number the nodes in your diagram and have no activities leading from higher to lower numbered nodes. Introduce dummy activities as needed, and indicate any dummy activity by using a dashed line. Activity Immediate Predecessors B A, B D E F G D, E H G F, H - I 2. Find the earliest start times (ES),latest completion times (LC), the floats for all the edges (just fill in the tables) and identify the critical path for the following critical path diagram: [The edge labels are durations for the activities.] ES LC Node 1 2 3 4 Activity Float A: 12 B: 14 C: 2 - 4 D: 2 - 3 E: 3 + 7 F:45 G: 5 + 6 H: 57 I: 78 5 6 7 8 3. The following tables give the activities, usual times, crash times and cost per unit time of reduction for activities in a project.Activities with no crash time entry cannot have their time reduced