Suppose that you have to schedule and coordinate the various activities for a custom app project. The project can be subdivided into the following ten activities.

$\backslash$table$[[$Activity$,\backslash$table$[[$Immediate$],[$Predecessor$]],\backslash$table$[[$Expected Activity$],[$Time $($days$)]]],[$A$,-,6],[$B$,-,4],[$C$,$A$,7],[$D$,$A$,3],[$E$,$A$,10],[$F$,$C$,5],[$G$,$C$,$ D$,7],[$H$,$B$,$ E$,10],[$I$,$H$,7],[$J$,$F$,$ G$,$ I,$5],[,,$Total $=64]]$

You can see the project network below. After detailed analysis of the project, you found

the expected activity times $($in days$)$ for all ten activities. These numbers are

incorporated into the project network.

Use the given information to answer to the following questions.

$($a$)$ Fill in the activity nodes.

$($b$)$ The critical path is

$.$ If you get more than one critical path, please

select the upper one. For example, if you have A$-$C$-$G$-$J and B$-$H$-$I$-$J$,$ then you have to

select A$-$C$-$G$-$J$.$

$($c$)$ The expected optimal completion time is $E(t)=$

days.

$($d$)$ Based on the results for the questions $($a$)-($b$),$ answer the following questions:

How many days the activity B can be delayed without increasing the expected

project completion time?

Is it possible that the activity $E$ is delayed without increasing the expected project

completion time?

$($e$)$ The following table shows the calculated expected variance for each activity.Based on the result for question $($b$)$ and the table above, calculate the expected

standard deviation for the project completion time. Round the result to $2$ decimal

places.

$(T)=$

days