[Solved]Question 1 35 Points Matrix Chain Multiplication Matrix Chain Order P Array M N P Length 1 Q37148921

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 table entries in a call of MATRIX-CHAIN-ORDER a) In computing m[1,3], how many other entries are referenced? What are they? Which entries are referenced exactly once? b) What are R[1,1], R[2,2], R[3,3], R[4,4]? c) Let N be the number of iterations executed in the i-loop. Express N with n and I. Let Nk be the number of iterations executed in the k-loop. Express Nk with l d) Within each iteration of the k-loop, m is referenced twice. Therefore, the total number of times that m is referenced is Σ-2 NiNk . 2 Show that Σ.2 NiNk . 2-3n 2n+2u n(n+1)(2n+1 You will find the equation useful Show transcribed image text 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

Expert Answer

---

Answer to Question 1 (3.5 points) Matrix chain multiplication. MATRIX-CHAIN-ORDER (p) array m I n = p. length-1 2 let..n. 1..n] an… . . .