Problem 2. Let A1,...,An be matrices with A; having ki-1 rows and k; columns for i=0,1,2,...,n. and some positive integers ko, k1, ..., kn. The problem is to choose the order of multiplying the matrices that will minimize the number of multiplications needed to compute the product AjA2 An. (a) Formulate a dynamic programming problem to determine the optimal order in which to mul- tiply the matrices. Clearly formulate the dynamic programming equation. (b) Solve the problem numerically, when n=4 and (ko, k1, ... ,ka) = (10,30,70,2, 100). For all problems, you can use any software to code the dynamic programming equation and solve. However, you cannot use an optimization solver to solve the problems. Please, provide printouts