Suppose that we would like to improve Strassen’s Algorithm by splitting the matrices Suppose that we would like to improve Strassen’s Algorithm by splitting the matrices into smaller pieces, say of size n/3 × n /3 . We may then note that we have T(n) = aT(n/3) + Θ(n2), where a is the number of recursive calls. What is the highest allowed value for a so that this would actually be asymptotically faster than Strassen’s? Recall that Strassen’s Algorithm takes Θ(nlog(7)) time. Justify your solution with the master theorem.
