Given a precedence network for small project. Find: All times in the box. Project duration Critical path Initial Time Terminal Time EF + FS LS. - FS ES; - EF - FS [1]ES = Max(all) ES + SS [3]LF = Min(all X LF - FF ES, - ES -SS, EF + FF-D LS - SS+D FF = Min(all) EF - EF - FF ES + SF-D || LF - SF + D) [2]EF = ES +D [4]LS = LF-D EF - ES, -SF 1 10 8 8 SF 6 B D FS 5 SS 4 FF 6 12 14 16 4 ZZ 3,6 4 E F H SS 4 FF3 22 5 SS 11 C G Given a precedence network for small project. Find: All times in the box. Project duration Critical path Initial Time Terminal Time EF + FS LS. - FS ES; - EF - FS [1]ES = Max(all) ES + SS [3]LF = Min(all X LF - FF ES, - ES -SS, EF + FF-D LS - SS+D FF = Min(all) EF - EF - FF ES + SF-D || LF - SF + D) [2]EF = ES +D [4]LS = LF-D EF - ES, -SF 1 10 8 8 SF 6 B D FS 5 SS 4 FF 6 12 14 16 4 ZZ 3,6 4 E F H SS 4 FF3 22 5 SS 11 C G