please show all work clearly

TABLE 10-16 9. Suppose that the precedence relationships for Problem 1 in Table 10-16 are all direct finish-to-start relationships with no lags except for the following: B to E: S-S with a lag of 2. D to H: FF with a lag of 3 . F to L: S-S with a lag of 2 . G to N: S-S with a lag of 1. G to M: S-S with a lag of 2 . Formulate an activity-on-node network representation and recompute the critical path with these precedence relationships