(Choose 1 answer)
(See picture)
Volker Strassen's Fast Matrix Multiplication algorithm requires f(n) operations to multiply two n x n matrices,where f (n) satisfies the recurrence relation
A. 878
f(n) = 7f (+15n24with f(1) = 1.
B. None of the other choices is correct
C. 1534
D. 1920
33/50-CAP
Ε. 1738
Find the number of operations needed by such algorithm to multiply two 8 × 8 matrices.
R
Q: 35
