(Solved): Question II (25 points): Consider applying the Matrix Chain Multiplication Algorithm on the follow ...

Question II (25 points): Consider applying the Matrix Chain Multiplication Algorithm on the following five matrices: \[ M_{1}: 7 \times 4 \quad M_{2}: 4 \times 6 \quad M_{3}: 6 \times 9 \quad M_{4}: 9 \times 3 \quad M_{5}: 3 \times 5 \] 1) (20 points) Find the minimum number of scalar multiplications needed to multiply the five matrices, \( C[1,5] \). Show all your calculations. 2) (5 points) Find the optimal parenthesizing corresponding to the optimal value found in part 1.