The complexity of the matrix multiplication algorithm using the divide and conquer strategy is $lo{g}_2(n)$ because:

Select one:

We only consider the top right corner of the matrix

We generate a tree of multiplication

We divide and multiply $n$ times

The number of times we need to divide $n$ by $2$ to get $1$ is $lo{g}_2(n)$