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}$$?

Consider a $$PERT$$ network for a project involving six tasks ($$a$$ to $$f$$)

The expected completion time of the project is

Consider a $$PERT$$ network for a project involving six tasks ($$a$$ to $$f$$)

The standard deviation of the critical path of the project is

A project has six activities $$(A$$ to $$F)$$ with respective activity durations $$7,5,6,6,8,4$$ days. The network has three paths $$A-B,C-D$$ and $$E-F.$$ All the activities can be crashed with the same crash cost per day. The number of activities that need to be crashed to reduce the project duration by $$1$$ day is