Question: Recall from linear algebra that we define the matrix product AB = C where Cij= (SUM k) Aik Bkj Using Big-Oh notation gives the asymptotic time complexity for the brute force implementation of matrix multiplication for:
Part 1: Two square matrices (n x n)
Part 2: Two rectangular matrices (m x n) and (n x r)
Show the matrix product and implementation of matrix multiplication. Please show me all the working and provide the answer.