Please answer a,b and c

no specific language is needed, just general pseudo code

0.1 Consider the matrix product A x B x CxDx E, where the matrix sizes are 3x7, 7x5, 5x8, 8x10, 10x7 respectively. a. We are interested in finding the matrix parenthesization that will necessitate performing the most number of number multiplications. Define the function C[i,j] you will compute. b. Give recursive formula for this function C[i,j]. El use tabulation to compute C[i,j]. Don't forget to also compute the Helpful Hints (HH) array