2. (5 points) Consider the problem of matrix multiplication, where the input includes two matrices, A (of dimension n x k) and B (of dimension k x m), the output is matrix C (of dimension nxm). Recall that each element C[i][j] in matrix C is the sum of the element-wise products of the i-th row of A and the j-th column of B. Consider the following pseudocode for matrix multiplication. Express the running time of the algorithm in big-Oh notation with the above dimension parameters. Algorithm mat Product (A, B): for (i = 0: n-1) do for (j = 0: m-1) do c[i][j] = 0 for (h= 0: k-1) do C[i] [j] += A[i] [h]* B [h] [j] C[i][j]