Please solve all these problems, by using principles of Strassen's algorithm. Thank you!

4.23 How would you modify Strassen's algorithm to multiply nn matrices in which n is not an exact power of 2? Show that the resulting algorithm runs in time (nlg7). 4.24 What is the largest k such that if you can multiply 33 matrices using k multiplications (not assuming commutativity of multiplication), then you can multiply nn matrices in time o(nlg7) ? What would the running time of this algorithm be? 4.25 V. Pan has discovered a way of multiplying 6868 matrices using 132,464 multiplications, a way of multiplying 7070 matrices using 143,640 multiplications, and a way of multiplying 7272 matrices using 155,424 multiplications. Which method yields the best asymptotic running time when used in a divide-and-conquer matrix-multiplication algorithm? How does it compare to Strassen's algorithm