explain how to solve it and why the time complexity is O(m^2*n^0.81)

 

Problem 3. Assuming m>n, give an algorithm to multiply an m x n matrix with an n x m matrix in O(m-n0.81) time. (Hint: apply Strassen's algorithm to multiply [m/n]2 pairs of order-n matrices.)