Construct the project network comprised of activities A to P that satisfies the following precedence relationships:

(a) A, B, and C, the first activities of the project, can be executed concurrently.

(b) D, E, and F follow A.

(c) I and G follow both B and D.

(d) H follows both C and G.

(e) K and L follow I.

(f) J succeeds both E and H.

(g) M and N succeed F, but cannot start until both E and H are completed.

(h) O succeeds M and I.

(i) P succeeds J, L, and O.

(j) K, N, and P are the terminal activities of the project.