01. Find the best order (minimum number of multiplications) to multiply the following matrix chain by using dynamic programming algorithm in the way we did in the cla with another example. You need to show detail of computation of each diagonal for MOD table and the value of k that minimizes the splitting. Also show the final factor table Draw more tables as needed. sS Ai A2 As A4 As As The dimensions of the matrices are 5x10, 10x3, 3x12, 12x5, 5x50, 50x6, respectively. k 1,2, 3, 4, 5 0 0 0 0 150 0 360 k 2, 2, 4,4 0180 0 3000 1500 0