A $2-$D array A$[0..$n$-1][0..$n$-1]$ represents a binary image of n by n pixels. An element of A is either $0$ representing a black pixel or $1$ representing a white pixel. The following algorithm receives the image A and produces another binary image B of the same size.

ALGORITHM Enigma $($A$,$ B$,$ n$)\{$

for $($int i $=0$; i $<$ n; i$++)$

for $($int j $=0$; j $<$ n; j$++)$

$\}$

$1.2.3.$

B$[$i$][$j$]=($A$[$j$][$i$]+1)\%2$;

What does this algorithm do$?$

Find the number of arithmetic operations T$($n$)$ done for a given n$.$ What is the Big$-$O complexity of the algorithm in terms of n$.$

ALGORITHM Fun $($a$[],$ int s$,$ int e$)\{$

int m$=$s;

for j $=$s$+1$toe

if $($a$[$j$]$