Please provide with a proper answer rather an explaination on how to do it.

Apply dynamic programming and find where to parenthesize a chain of matrices so that finding their product will require only minimum number of scalar multiplications. Print the parenthesized chain of matrices. For example, let the 4 matrices be A(42),B(23),C(32) and D(24), find the product of the four matrices with parentheses attached. Print the parenthesized chain of matrices