Square Matrix Multiply Recursive in Java using Divide and Conquer?

Question

I have a school project to create 2 versions of a javacode that multiplies two square matrices. To make it easier, they only have to work for 2x2, 4x4, 8x8 etc. We have a pseudo

Answer 1

if(n==1) {
    c[0][0] = a[0][0] * b[0][0];
} else {
    do partition part;
}
return c;