Use the matrix multiplication algorithms to determine the most efficient order to multiply the matrices in each of the following cases. Show the tabulation of table m that contains the minimum cost and table s to store the location of k for parenthesis paring. a. M1 is 3 x 5, M2 is 5 x 2, M3 is 2 x 1, and M4 is 1 x 10. b. Matrices P, Q, R and S which are 20 x 15, 15 x 30, 30 x 5 and 5 x 40 matrices respectively. c. Matrices P, Q and R which are 10 x 20, 20 x 30 and 30 x 40 matrices respectively.