Test $($A$[0..$n $1,0..$n$-1],$ n$)$

$//$Input: Adjacency matrix A$[0..$n $1,0..$n $1])$ of an undirected graph G with n edges for i $0$ to n $2$ do

for j $$i $+1$ to n $1$ do

for k$$i to n do

A$[$j$,$ k$]$A$[$j$,$ k$]$ A$[$i$,$ k$]$ A$[$j$,$ i$]/$ A$[$i$,$ i$]$

if n $=1$ return $1$ else

if $($Test $($A$[0..$n $2,0..$n $2],$ n$-1)==0)$ return $0$ else for j $0$ to n $2$ do

if A$[$n $1,$ j$]=0$ return $0$

return $1$

Calculate time complexity of this recursive algorithm?