1. Use Strassen's algorithm to compute the matrix product
Show your work.
2. Write pseudo code for Strassen's algorithm.
3. How would you modify Strassen's algorithm to multiply n X n matrices in which n is not an exact power of 2? Show that the resulting algorithm runs in time T(nlg7).
4. What is the largest k such that if you can multiply 3 x 3 matrices using k multiplications (not assuming commutatively of multiplication), then you can multiply n X n matrices in time o(nlg 7)? What would the running time of this algorithm be?