Need a network diagram

N$/$attempt$/\_4893362\_1?$courseld$=\_36282\_1$

$\backslash$table$[[$Activity$,$Duration,Predecessor,Cost to crash by $1$ day,Max days to crash$],[$A$,5,-,300,1],[$B$,3,-,$$$100,1],[$C$,4,$A$,$$$100,1],[$D$,3,$A$,$$$200,2],[$E$,4,$B$,$$$400,3],[$F$,2,$D$.$ E$,$$$500,2],[$G$,4,$E$,$$$300,3],[$H$,3,$$$,100,2]]$

What is the critical path of this project?

What is the duration of this project? $($before crashing$)$

If your task is to crash this project by $2$ days, what is the most efficient cost of doing it$?($Just input the number with no decimals or dollar signs$)$

Suppose that the project duration that you have calculated in question $2($before crashing$)$ is the expected duration of the project. Its variance of the critical path is $4$ days. The principal requires you to complete the project before the day $15.$ If you finish later, you will incur a fine. What is the probability of receiving a fine?

Your manager wonders whether or not you should crash the project by $2$ days. If you do$,$ the variance of the project duration will remain the same. What is the probability that you will receive a fine? Based on your calculations in Q$4$ and Q$5,$ would you recommend crashing the project?

Grading Rubric

Your assignment will be graded according to the grading rubric. Detailed grading rubric and policy can be in the class syllabus, pages $5-8$