hello tutors... please abswer theoretical analysis for the following code

THEORETICAL ANALYSIS ON PAPER (OR ELECTRONIC PAPER) Do a theoretical analysis of the following C++ function mmultiply. Count the number of multiplications done in mmultiply (and its helper functions) as a function of n. Subsequently express the answer in big O notation. Show your workings (how did you come up with the function on the number of multiplications). int I( int i, int j, int n ) return n * i + j; int dotProduct ( const int A, const int B, int i, int j, int n ) int t = 0; for ( int k=0; k<>