Consider a chain of 'n' matrices , where A, is a matrix of size D[2*(i-1)] * D[2*i - 1], i = 1, 2..., n. In 'Matrix Chain Multiplication', Ai* Ai+1 refers to the multiplication of the two matrices. Here, we redefine Ai*Ai+1 as an operation whose number of computations is a product of the number of rows of Ai and number of columns of Ai+1. Design and analyze an efficient algorithm to identify one way of fully parenthesizing A*A2*...*An, such that the number of computations is minimum.

Steps: 1.logic 2.illustration 3.pseudocode 4.proof of correctness 5.time complexity