Please use the appropriate notation and explain a bit,thank you so much

4.5-2 Professor Caesar wishes to develop a matrix-multiplication algorithm that is asymptotically faster than Strassen's algorithm. His algorithm will use the divide- and-conquer method, dividing each matrix into pieces of size n/4 x n/4, and the divide and combine steps together will take (n2) time. He needs to determine how many subproblems his algorithm has to create in order to beat Strassen's algo- rithm. If his algorithm creates a subproblems, then the recurrence for the running time T(n) becomes T(n) aT(n/4) + (n2). What is the largest integer value of a for which Professor Caesar's algorithm would be asymptotically faster than Strassen's algorithm