Problem
In dynamic programming algorithm for Matrix-chain Multiplication Problem (explained in the class) which computes the optimal parenthesization of n matrices, how many subproblems does the algorithm solve in order to solve a given instance of the problem?