7. PROJECT SCHEDULING A project consists of 7 activities A,..,G with the following predecessor activities, expected times and variances: (a) Activity E has an optimistic time of 4 days, a most probable time of 7 days and a pessimistic time of 10 days. How can the expected time of 7 days and the variance E2=1 be computed from these optimistic, most probable and pessimistic times? (b) Draw a project network. (c) Prepare an activity schedule, i.e. determine earliest and latest start and finish times. (d) What are the critical activities and what is the expected project completion time? (e) What is the variance of the expected project completion time? (f) Find the probability that the project will be completed in 29 or fewer days. HINT: Use the provided table for the standard normal distribution in file Area_for_the_Standard_Normal_Distrik (g) Formulate a linear programming model for crashing times for this project, do not solve it! As decision variables use xi= the earliest finish time for activity i yi= the amount of time activity i is crashed. Parameters are the maximal crashing times Mi, the costski to speed up activity i by one day and the new completion time Tnew=25 days