Using any software but P6, draw a precedence diagram (using Figure 6.14 on the textbook as example), based on the following information (the "precede" here means immediate precede): There are ten total tasks, named AJ. Tasks A, B, and H have durations of two days. Tasks C, E, I, and J have durations of three days. Tasks D, F, and G have durations of one day. Tasks A, B, F and D can be conducted in parallel. Tasks A and F must precede Task E. Task E must precede Task G. Task C must precede task B. Task B must precede Task H. Task D must precede Task I. Tasks G, H, and I may be conducted in parallel. Tasks G, H, and I precede Task J. Make sure to add the start node and the end node. Except for the very first and very last node, every node in the diagram should be connected from both left and right, meaning that they should have both predecessor(s) and successor(s).