Question $2.[10$ points$]$

The following table represents the activity list for a project.

$\backslash$table$[[$Precedence activity,$\backslash$table$[[$Activity$],[$Duration$]],$Activity,$\backslash$table$[[$Activity$],[$no$.]]],[dots,8,$A$,1],[A,12,$B$,2],[$B$,5,C,3],[$B$,10,D,4],[$C$,10,E,5],[C,10,F,6],[E,15,G,7],[E,12,H,8],[$F$,$H$,8,$I,$9],[I,10,L,10],[L,15,M,11],[M,J,K,5,N,12],[G,5,J,13],[$G$,10,K,14],[D,5,$Q$,15],[Q,15,R,16],[R,10,S,17],[$D$,10,T,18],[T,20,U,19],[U,10,V,20],[S,V,12,W,21],[$W$,13,x,22],[x,5,Y,23],[S,V,5,$Z$,24],[Z,15,$R$0,25],[$Ro$,15,$R$1,26]]$

a$.$ Draw an Activity On Arrow network $($AOA$)$ for this project to determine the minimum duration to execute this project.

b$.$ Specify the critical path.

c$.$ Specify the possible paths for executing this project and identify the required duration for each path.