Suppose that you have to schedule and coordinate the various activities for an

accounting project. The project can be subdivided into the following ten activities.

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.

$7$

$$

$$

$($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 $D$ can be delayed without increasing the expected

project completion time?

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

completion time? Select an answer