matrix multiplication open Mp and sequential

given matrix A(m*r)m rows and r column, where each of its elements is denoted ai with 1<i<m and 1<j<r and matrixb(r*n) r rows and n column,where each of its elements is denoted bij with 1<-i<n, the matrix C resultingfrom the operation of multiplication of matrices A and B, C =A+B, is such that each elements is denoted ij with 1< I <n. -for simplicity,we will wor with square matrices of size n*n -the matrices to multiply will be A and [login to view URL] will be dense matrices with few 0's the result will be stored in the matrix C. -time is culculate - 2 code 1:sequentially matrix multiplication and the result 2: Open mp parallel and result include design of the parallel [login to view URL] you plan to do the parallel programming to make sure it good and perform well The algorithms is to be implemented using OpenMP shared memory architecture. Run your parallel programs for matrix sizes n=10,20,50,200,500 and 1000 using 1,2,4,8,16 threds Compare the performance of the sequential and parallel programs