Process the following matrix multiplication by using the algorithm below and show your work.

C, Java or Python languages are acceptable

C= 1 1 2 2 1 1 2 2 3 3 4 4 3 3 4 4 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1

SQUARE-MATRIX-MULTIPLY-RECURSIVE(A, B) 1 n = A.rows 2 let C be a new n xn matrix 3 if n == 1 4 Cu = au bu 5 else partition A, B, and C as in equations (4.9) 6 Cu SQUARE-MATRIX-MULTIPLY-RECURSIVE(A1, Bu) + SQUARE-MATRIX-MULTIPLY-RECURSIVE(A12, B21) 7 C12 = SQUARE-MATRIX-MULTIPLY-RECURSIVE(A11, B12) + SQUARE-MATRIX-MULTIPLY-RECURSIVE(A12, B22) 8 C21 = SQUARE-MATRIX-MULTIPLY-RECURSIVE(A21, Bu) + SQUARE-MATRIX-MULTIPLY-RECURSIVE(A22, B21) 9 C22 SQUARE-MATRIX-MULTIPLY-RECURSIVE(A21, B12) + SQUARE-MATRIX-MULTIPLY-RECURSIVE(A22, B22) 10 return C @ screenshoter 1