Consider a project with 12 activities A1, A2, ..., A12. Al is the first activity starting from day 0 and A12 is the last activity. Consider the dependency relations and the activity durations provided below. Activity Duration Immediate predecessor A1 6 None A2 3 A1 A3 4 A1 A4 8 A1 A5 10 A2 A6 9 A3 A7 16 A3 A8 13 A4 A9 8 A5 A10 10 A6 A11 6 A7, A9, A10 A12 3 A8, A11 Q3.1 For each activity, compute the late start, the late completion, and the slack time. (1 point) Q3.2 Twelve persons P1, P2, ..., P12 are assigned to activities A1, A2, ... A12, respectively. If P5 asks for leave for 5 days (from day 12 to day 16), can the leave application be approved without affecting the completion of the project? If A5 can also be completed by P6, P7 or P8, which person can be assigned to A5 without affecting the completion of the project (The person assigned to A5 also needs to complete his/her own activity)? (2 points) Q3.3 Which activity whose duration reduces by 3 will lead to the decrease of the duration of the whole project by 2? (Please show all the possible activities.) (1 point)