Note: Please use the recommended text book as Introduction to Algorithms (3rd Edition).
Please post the answers in text format.
Dynamic programming and greedy algorithm: 5. Review the textbook on the matrix chain multiplication problem. Find an optimal parenthesization of a matrix-chain product whose sequence of dimensions is p. Follow the textbook convention and show all intermediate results (including tables m and s). [10 points]