The picture is needed to do the homework.

a$.$ Let$$s say that the basic operation of any equal is the evaluation of the if$-$statement, i$.$e$.,$ if $($A$[$i$][$j$]==$ A$[$k$][$m$]$ && $!($i $==$ k && j $==$ m$))$

What is the worst$-$case time complexity of any equal when A is an n $\backslash$times n two$-$dimensional array?

$($b$)$ Draw an example of a two$-$dimensional array that causes any equal to run in the worst$-$case when n $=5.$

$($c$)$ What is the best$-$case time complexity of any equal?

$($d$)$ Draw an example of a two$-$dimensional array that causes any equal to run in the best$-$case

when n $=5.$

$($e$)$ Does any equal have an every$-$case time complexity? Why or why not?