Consider the following algorithm to multiply two matrixes. Assume A and B are two n x n matrixes. Assume a_{i,j} is the element of A at row i and column j

Assume b_{i,j} is the element of B at row i and column j. Assume c_{i,j} is the element of C at row i and column j. SQUARE-MATRIX-MULTIPLY(A,B) 1 n = A.rows 2 let C be a new n x n matrix 3 for i = 1 to n 4 for j = 1 to n 5 c_{i,j} = 0 6 for k = 1 to n 7 c_{i,j} = c_{i,j} + (a_{i,k} * b_{k,j}) For each line from Line 3 included to Line 7 included: Assign cost and the times the line is executed. Simplify the formula of the running-time of line 7 to obtain it in a polynomial form.