do all

In problems P3 and P4: (a) Solve the network for the basic scheduling information for each of the activities (ES , EF, LS, LF, FF, TF) and lags of the links. High light the critical path (CP) P3) (20 points) (b) Solve the following by the Series Method of source allocation. The resource limits are as follows: 4M and 2H. Activity ES Duration LS EF FF TF LF Resources D 2 5 E 24 1 M.2H 2M 2H 1 F 3 1 S B 23 SI 3M.2H G $ 2 10 3M 2M, 1H 3M.2H A 1 3 2M. 1H 2 H 3 9 2 2M 2M 1 4 2 5 6 7 O 3 Dur 8 Act LS 12 16 13 17 14 10 11 15 Resource TE 0 A 2M 1H - 1 1 B 3M 2H 3 0 2 2M 2 4 D IM 2H 2 E 2M 2H 4 7 F 2M IH 3 6 G 3M 2 9 ---- DE H 2M 3 8 - IM TH 1 11 EM Max 4 Max 2