![Question 1 (3.5 points) Matrix chain multiplication. MATRIX-CHAIN-ORDER (p) array m I n-p.length1 2 let.n.1..n] ands.n- 1,2..](https://media.cheggcdn.com/media%2F3c0%2F3c01ee9b-3d32-429a-be55-2bfb2d951077%2FphpY20PZh.png)
Question 1 (3.5 points) Matrix chain multiplication. MATRIX-CHAIN-ORDER (p) array m I n-p.length1 2 let.n.1..n] ands.n- 1,2..n] be new tables 3 fori1 ton 4 5 for 2 to n I// 1 is the chain lengtlh for to-1 for k- to j -1 if q < mli.j] 12 14 return m and s Let R[i,j] be the number of times that table entry m[i,j] is referenced while computing other table entries in a call of MATRIX-CHAIN-ORDER ) In computing m[1,3], how
OR
OR