[Solved] Note Question 1 35 Points Matrix Chain Multiplication Matrix Chain Order P Array M N Pleng Q37160599

NOTE: Question 1 (3.5 points) Matrix chain multiplication. MATRIX-CHAIN-ORDER (p) array m n-p.length -1 2 let m[..n, 1..n] and s[1..n -1,2.n] be new tables 3 fori – 1 to n 4 1 5 forl- 2 to n // 1 is the chain length fori-1 ton-11 for k – i to j – 1 0 0 0 if q < m[i,j] 12 13 14 return m and s Let R[ЪЛ be the number of times that table entry m [Lj] is referenced while computing other table entries in a call of MATRIX-CHAIN-ORDER. a) In computing m[1,31, how many other entries are referenced? What are they? Which entries are referenced exactlv once? What are R[1,1], R[2,2], R[3,3], R[4,4]? Let Ni be the number of iterations executed in the i-loop. Express Ni with n andI. Let Nx be the number of iterations executed in the k-loop. Express Nk with l b) c) d) Within each iteration of the k-loop, m is referenced twice. Therefore, the total number of times that m is referenced is Σ 2 N,Nk . 2. Show that Σ-2 NiNk . 2 Hint: You will find the equation XL1 i2- Show transcribed image text NOTE: Question 1 (3.5 points) Matrix chain multiplication. MATRIX-CHAIN-ORDER (p) array m n-p.length -1 2 let m[..n, 1..n] and s[1..n -1,2.n] be new tables 3 fori – 1 to n 4 1 5 forl- 2 to n // 1 is the chain length fori-1 ton-11 for k – i to j – 1 0 0 0 if q

Expert Answer

---

Answer to NOTE: Question 1 (3.5 points) Matrix chain multiplication. MATRIX-CHAIN-ORDER (p) array m n-p.length -1 2 let m[..n, 1….. . . .