) Consider a project having the following activities and their estimates: Activity Immediate predecessor Activity time (in weeks) Most optimistic Most likely Most pessimistic A - 3 4 5 B - 4 8 10 C B 5 6 8 D A,C 9 15 10 E B 4 6 8 F D,E 3 4 5 G D,E 5 6 8 H D,E 1 3 4 I G 2 4 5 J F,I 7 8 10 K G 4 5 6 L H 8 9 13 M J,K,L 6 7 8 Required i. Draw network diagram for the project. (6 Marks) ii. Compute the expected project completion time. (2 Marks) iii. What is the critical path? (1 Mark) iv. Compute the project variance (2 Marks) v. Briefly explain two techniques that can be applied before the standard Hungarian method is used on an assignment problem of maximization type.