$\backslash$table$[[$Activity$,$Predecessor,OT$,$ML$,$PT$],[$A$,-,2,6,10],[$B$,$A$,1,6,17],[$C$,$A$,1,3,17],[$D$,$C$,1,6,17],[$E$,$B$,2,3,16],[$F$,$C$,1,6,17],[$G$,$E$,$D$,1,3,17],[$H$,$G$,2,6,16],[$I$,$H$,2,6,10],[$J$,$F$,1,3,11],[$K$,$I,J$,2,9,10],[$L$,$K$,2,6,16],[$M$,$L$,2,3,10],[$N$,$J$,2,6,16],[$O$,$M$,$N$,1,6,11]]$

Only the techniques that you have learned in the course will be accepted.

Activity name, immediate predecessor, optimistic, most likely and pessimistic times for activities are given above.

a$)$ Draw the project network using Activity$-$on$-$Arrow technique.

b$)$ What is the total project duration?

c$)$ What is$/$are the critical path$($s$)?$

d$)$ What would the project duration need to be such that we have a $95\%$ probability of completing the project in that amount of time?