As described, Strassen's algorithm works for exact powers of 2 . We could modify Strassen's algorithm to multiply two nn matrices, where n is not an exact power of 2 as follows: We add as many zeroes at the end of each row and column as needed to turn the matrix into a larger square matrix, whose number of rows (and columns) would be the next higher power of 2, and extract the first n rows and columns from the result! Argue that the resulting algorithm also runs in (nlg7) time