Below you will find two sequential codes. Augment the code snippets with OpenMP pragmas if

applicable. You have to make sure that no dependencies are broken and thus the algorithm still

computes correct result. Please include all the necessary clauses in the programs, including

the variable scope clauses. If the algorithm is parallelizable, discuss your parallelization

strategy. Otherwise, explain why it cannot be parallelized. Justify your claims.

$(2$a$)\{10$ points$\}$ Dense matrix multiplication

$//$ computes the product of an M x L matrix A

$//$ with an L x N matrix B

double sum $=0$;

for $($i $=0$; i $<$ M; i$++)\{$

for $($j $=0$; j $<$ N; j$++)\{$

sum $=0$;

for $($k $=0$; k $<$ L; k$++)\{$

sum $+=$ A$[$i$*$L $+$ k$]*$ B$[$