Let A and B be n by n matrices. Recall that the straightforward (i.e. non- Strassen) calculation of C = AB takes n3-ish steps in the computational model, where we count every multiplication and addition as a single step. Assume now that the entries of A and B are m-digit numbers (in binary), where m is several thousands, and that that we need this calculation for cryptographic purposes. What is the complexity of the straightforward (i.e. non-Strassen) matrix multiplication in the model where we count every bit operation as one step? Justify your answer.