The complexity of the matrix multiplication algorithm using the divide and conquer strategy is log(n) because: O a. We generate a tree of multiplication O b. The number of times we need to divide n by 2 to get 1 is log (n) We divide and multiply n times We only consider the top right corner of the matrix O c. O d. cross out cross out cross out. cross out