How many comparisons does this algorithm has? Algorithm1(A[0. n- 1]) // Input: Array A[0. n- 1] of numbers .... .... count 0 for i 1 to n- 2 do for j=i+2 ton do if |A[i] – A[j]] < 10 count count + 1 return count

Please help with this question. Your assistance is greatly appreciated.

Write the algorithm which finds the second maximum value of the array. Then find the complexity of the algorithm as Big O notation

Problem2: A square matrix can be represented by a two-dimensionalarray with N rows and N columns. You may assume a maximum size of 50 rows and 50 columns. 1. Write an algorithm MakeEmpty(n), which sets the first n rows and n columns to zero. 2. Write an algorithm Add(M1, M2, M3), which adds two matrices M1 and M2 together to produce matrix M3. 3. Write an algorithm Subtract(M1, M2, M3), which subtracts matrix M2 from matrix M1 to produce matrix M3. 4. Write an algorithm Copy(M1, M2), which copies matrix M1 into matrix M2.