The project activities, precedence relationships and durations are described in the table. The critical path of the project is

Consider the following network

The optimistic time, most likely time and pessimistic time of all the activities are given in the table below :

The critical path duration of the network (in days) is

Consider the following network

The optimistic time, most likely time and pessimistic time of all the activities are given in the table below :

The standard deviation of the critical path is

For the network below, the objective is to find the length of the shortest path from node $$P$$ to node $$G.$$ Let $${d_{ij}}$$ be the length of directed are from node $$i$$ to node $$j$$. Let $${s_j}$$ be the length of the shortest path from $$P$$ to node $$j.$$ Which of the following equations can be used to find $${s_G}$$?