Suppose there is a method for multiplying $\backslash$times $$ matrices using only $$ multiplications $($not

assuming commutativity of multiplication of matrix elements$),$ where $<3.$ Explain how to

recursively multiply $\backslash$times $$ matrices $($where $$ is an exact power of $)$ in time $(3)$ by using this

method as a subroutine. What is the runtime of your algorithm?