pls help with questions and method, answer 1, comment anything else that is needed to help you answer

Question B1 (25 marks) A big construction project has the following list of activities with their durations (in months) and immediate predecessors. Activity Duration Immediate (Months) Predecessor A 4 B 5 A 7 A D 4 A E 9 F 4 B, C G 7 D, E H 5 F 3 G a) Draw a network diagram for the project. Calculate the earliest and latest start and finish times, and total float for each activity. Calculate the free and interfering float for the activities with positive total floats. Identify the critical activities and the critical path(s) and project duration (30% marks) - b) Unfortunately, after the first analysis, you realise that the project finishes 3 months later than the promised finished time. You can crash a few activities to make the project duration shorter. However reducing activity durations requires extra resources that will involve extra cost. The list of activities with the maximum crashing duration and crashing cost per month is given below. Identify the set activities with the crashing durations that will minimise the cost while finishing project on time. Activity Max Decrease (months) Cost (GBP/month) A D E 1 2 2 1 2 5000 6000 7000 5000 10000 - (30% marks) The construction company are happy with your previous analysis, and they have another project scheduling problem for you. They have a project with the following activities and network diagram. This project contains activities with stochastic durations. The standard deviation of each activity is given in a table below. The construction company want to know if they can finish this project on time (within 70 months) or not. (question and paper continue over)