Can anyone please help me with this question? Thank you,

1. The dynamic programming method for the matrix chain multiplication, which we did in the class, outputs the minimum number of operations (multiplications), but actually doesn't tell us in which order one needs to multiply the matrices. What modifications will you make in the pseudo-code, so that we can also determine in which order one needs to multiply them? Apply your pseudo-code to multiply the following chain of matrices in an optimal way: A A2AsA4As.A6, where the sequence of dimensions of these matrices are 3.5.3,7, 2.6.4 (i.e., the dimension of Al is 3 x 5, A2 is 5 x 3. A3 is 3 x 7, A is 7 x 2, As is 2 x 6, and As is 6 x 4). Please show your work