c) Given an algorithm as in Figure 1: ALGORITHM Enigma (A[0..n-1, 0..n-1]) // Input: A nxn matrix A[0..n-1, 0..n-1] of integers for i=0 to n-2 do for j=i+1 to n-1 do if A[i,j] !=A[j,i] return false return true Figure 1 i) Trace the output of the algorithm for the following input: Z = 1 2 6 7 2351 6582 7142 2 2 (5 marks)