2. Drawa precedence graph (a.k.a., dependency graph) that reflects the parallelism in the following code. Recall a precedence graph is a directed graph in which the nodes (vertices) represent processes and the edges represent the causal relation between two processes. If an edge exists from process node Pi to Pi then the process P; must start executing its code c; only when process P; finishes executing its code ci. Also we use the notation ParBegin and ParEnd to indicate a block in which program codes (or in- structions) must run in parallel. Another alternative notation that can be found in the literature is CoBegin and CoEnd for concurrent begin/end. Begin Co; ParBegin C1; Begin C2; 3; C4; End C5; C6; Begin C7; C8; C9; End ParEnd C10; End