Consider the problem of minimizing the total number of multiplications made in computing the product of n matrices 1 . 2 . . whose dimensions are 0 1 , 1 2 , . . . , 1 , respectively. Find an optimal parenthesization of matrix-chain product whose sequence of dimensions is 4, 10, 3, 12, 20,7 for the given n = 5. Apply dynamic program for the same. Also, design a dynamic programming algorithm for matrix chain multiplication. Use only c or c++ programming language