Only need to answer (A) and (C).

1.13 The transpose of matrix M is a matrix T such that T[i,j] = M[j,i], for all i and 1. (a) Write a parallel program using shared variables that computes the transpose of an n x n matrix m. Use P worker processes. For simplicity, assume that n is a multiple of P. (b) Write a parallel program using message passing to compute the transpose of square matrix M. Again use P workers and assume o is a multiple of P. Figure out how to distribute the data and gather the results. (c) Modify your programs to handle the case when a is not a multiple of P. (d) Experiment with your programs for various values of n and p. What is their performance? 1.13 The transpose of matrix M is a matrix T such that T[i,j] = M[j,i], for all i and 1. (a) Write a parallel program using shared variables that computes the transpose of an n x n matrix m. Use P worker processes. For simplicity, assume that n is a multiple of P. (b) Write a parallel program using message passing to compute the transpose of square matrix M. Again use P workers and assume o is a multiple of P. Figure out how to distribute the data and gather the results. (c) Modify your programs to handle the case when a is not a multiple of P. (d) Experiment with your programs for various values of n and p. What is their performance