Question 1 (3.5 points) Matrix chain multiplication. MATRIX-CHAIN-ORDER (p) array m I n = p. length-1 2 let..n. 1..n] and s.n -1,2..n] be new tables 3 fori1 ton 5 for 2 to n I// 1 is the chain lengtlh for to-1 for k- to j -1 if q < mi. j] 12 s[i,j] = k 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
OR
OR