Please use a recursive algo/Strassen's thm

Let A -[ai], B- [b.j] be two n x n matrices. Then the product of A and B is also an n x n matrix CAB- where ! Here, the (i,j)-entry of the product AB is obtained by multiplying the entries in the ith row of A by the corresponding entries in the jth column of B then add all the results For this problem, we are given the coefficients for the matrices A, B as two 2-dimensional arrayS bin a11 a12 .aln a21 a22a2 11 012 ..' b21 b22 TL a2nl and B = anl an2 ' Unn We want to compute the matrix product C:- AB and return the entries of C as another 2-dimensional arrav 12 Cin C21 C22 C2n LTL It is well-known that the straight-forward, iterative algorithm for this problem has runtime O(n3). Give a divide-and-conquer algorithm for this problem and give a time analysis for your algorithm in O form Let A -[ai], B- [b.j] be two n x n matrices. Then the product of A and B is also an n x n matrix CAB- where ! Here, the (i,j)-entry of the product AB is obtained by multiplying the entries in the ith row of A by the corresponding entries in the jth column of B then add all the results For this problem, we are given the coefficients for the matrices A, B as two 2-dimensional arrayS bin a11 a12 .aln a21 a22a2 11 012 ..' b21 b22 TL a2nl and B = anl an2 ' Unn We want to compute the matrix product C:- AB and return the entries of C as another 2-dimensional arrav 12 Cin C21 C22 C2n LTL It is well-known that the straight-forward, iterative algorithm for this problem has runtime O(n3). Give a divide-and-conquer algorithm for this problem and give a time analysis for your algorithm in O form