algorithm

number 5 please

Problem s in lecture we discussed Strassen's matrix multiplication algorithm, which uses a clever trick to reduce from eight to seven the number of element by element multiplications required to multiply two 2x2 matrices of elements, so the recurrence relation describing the running time of the Strassen algorithm is (W 1) One of Strassen's Diogenes Schmassen, subsequently proposed a modification to Strassen' algorithm which students. of multiplications further reduced from seven to four the number element-by-element matrix required to multiply two 2x2 matrices of elements, at the cost of increasing the number of additive operations required from 0 (N 2) to e (N2logaN), recurrence relation describing the running so the time of the so-called "Strassen-Schmassen" algorithm is: ms that Te o(Tenssen), and that the Strassen-Schmassen algorithm therefore larne Do you agree