Consider the execution of the following code segment consisting of seven statements. Use Bernsteins conditions to detect the maximum parallelism embedded in this code. Justify the portions that cannot be executed in parallel and the remaining portions that must be executed sequentially. Rewrite the code using parallel constructs such as Cobegin and Coend. No variable substitution is allowed. All statements can be executed in parallel if they are declared in the same block of a (Cobegin, Coend) pair.

S1: A = B + C

S2: C = D + E

S3: F = G + E

S4: C = A + F

S5: M = G +C

S6: A = L + C

S7: A = E + A