$3\mathrm{.}1$ You received this network diagram from your planner and he needs assistance

$(14)$

$\backslash$table$[[$ES$,$ID$,$EF$],[$SL$,0R,],[$IS$,,$LF$]]$

$\backslash$table$[[$Early Start,Task,Early Finish$],[$Slack $/$ Float,Duration,$],[$Late Start,,Late Finish$]]$

$\backslash$table$[[0,A,A1$

The planner asked you to give him guidance to determine the values $($weeks$)$ for the following by applying the Day Zero method:

a$.C1(2)$

b$.D1(2)$

c$.E_1(2)$

d$.E_2(2)$

e$.F2(2)$

f$.$ Indicate the critical path by stating the alphabetical range. $(2)$

g$.$ Indicate the number of weeks the critical path will have $($show all your calculations$).(2)$

$3\mathrm{.}2$ For a data migration project $($Mega IT project$)$ at a large company of which you are the project manager, you must control the costs of the project. Phase $1$ will take six $(6)$ months to complete, and you are three $(3)$ months into it$.$ The partial structure of Phase $1$ is as follows: