Consider the following algorithm to check whether a graph defined by its adjacency matrix is complete. ALGORITHM GraphComplete (A[o..n - 1, 0..n - 1]) //Input: Adjacency matrix A[..n-1, o..n-1) of an undirected graph G /lOutput: 1 (true) if G is complete and o (false) otherwise if n = 1 return 1/one-vertex graph is complete by definition else if not GraphComplete(A[o..n - 2, o..n - 2]) return o else for j 0 to n-2 do ifA[n-1, j] = o return o return1 What is the algorithm's efficiency class in the worst case