Can somebody show me how to make this piece of code into a flow map and how to use the fork-join-quit model?

Refer to the code segment below. It might be helpful to think of the expressions as comprising large matrix operations. Note that operations are frequently dependent on the completion of previous operations: for example, Q1 cannot be calculated until M2 has been calculated. a) Express the code as a process flow graph maintaining the expressed precedence of operations (eg: M1 must be calculated before QR2 is calculated). Use the left hand sides of the equation to label processes in your process flow graph. NOTE: part a) is a bi you will need to use some empty (or epsilon transition) arcs-that is, arcs not labeled by processes-to get the best graph. Implement the process flow graph using fork that the maximum parallelism is achieved in both parts of this problem! If the graph from the first part is correct, this part is actually easy. b) , join, and quit. Ensure M1 A1 A2 M2 = (A1+A2)"B1; QR2 M1 A1; Q1 M2 + B2; QR1 = M2-M1; QR3 A1'81; Z1-QR3-QR1; Refer to the code segment below. It might be helpful to think of the expressions as comprising large matrix operations. Note that operations are frequently dependent on the completion of previous operations: for example, Q1 cannot be calculated until M2 has been calculated. a) Express the code as a process flow graph maintaining the expressed precedence of operations (eg: M1 must be calculated before QR2 is calculated). Use the left hand sides of the equation to label processes in your process flow graph. NOTE: part a) is a bi you will need to use some empty (or epsilon transition) arcs-that is, arcs not labeled by processes-to get the best graph. Implement the process flow graph using fork that the maximum parallelism is achieved in both parts of this problem! If the graph from the first part is correct, this part is actually easy. b) , join, and quit. Ensure M1 A1 A2 M2 = (A1+A2)"B1; QR2 M1 A1; Q1 M2 + B2; QR1 = M2-M1; QR3 A1'81; Z1-QR3-QR1