Consider the following algorithm 2. 1. def mystery(A[0..n-1, 0..n-1]): for(i to n-2): for(j=1+1 to n-1): if A[1,] - A[ j.i] 3 4. 5. 6. return True return False What does this algorithm compute? What is its basic operation, write the line number of code (1, 2, 3, 4, 5, or 6) that is executed maximum number of times? What is the time complexity of this code?