Consider the following algorithm that checks whether a graph represented by its adjacency matrix is complete: Algorithm 2: Graph Complete Input: An zero-indexed adjacency matrix A of a undirected graph G Output: A Boolean value of true if graph is complete, false otherwise if n = 1 then L return true; else if NOT (GraphComplete (Aln-2),A(n-2])) then L return false; else for j in /0..7.-2do if A-1.j = 0 then L return false; What is this order of this algorithm in the worst case? Justify your