Problem $(3$ marks$)$:

What is the complexity of the given code as a function of the problem size $n?$ Show the

$($complete$)$ details of your analysis. This is a Complexity Analysis, not a Complexity

Estimation. You must follow the process presented in the Week$-2$B lecture, considering the

Best Case, Worst Case and Average Case.

Note: a $[$i$]$ is an array with $n$ elements.

Code Example #$1$

Matrix multiplication

$A_{}*B_{}=C_{}$

Code Example #$1$

Matrix multiplication

$A_{}*B_{}=C_{}$