3. (20 points) The 2-D array A of floating point values representing the adjacency matrix of a weighted non-directed graph with N vertices is input to the following algorithm: ALGORITHM Enigma (A[0..N - 1, 0..N - 11) //Input: A matrix A[0..N - 1, 0..N - 1] of floating point values { int D = 0; for i = 0 to N-1 for j = 0 to N-1 { if (Ajj ! = 0) D =D +1; } return D/2; } What is the objective of this algorithm? Find T(N) = number of array element comparisons + number of arithmetic operations needed to return the result. Find the best and worst case complexities of this algorithm in terms of N. 3. (20 points) The 2-D array A of floating point values representing the adjacency matrix of a weighted non-directed graph with N vertices is input to the following algorithm: ALGORITHM Enigma (A[0..N - 1, 0..N - 11) //Input: A matrix A[0..N - 1, 0..N - 1] of floating point values { int D = 0; for i = 0 to N-1 for j = 0 to N-1 { if (Ajj ! = 0) D =D +1; } return D/2; } What is the objective of this algorithm? Find T(N) = number of array element comparisons + number of arithmetic operations needed to return the result. Find the best and worst case complexities of this algorithm in terms of N