Hi can someone help me solve these problems for my study guide please

1. Consider the following algorithm Eind Measure of input size Basic step, and The efficiency class of this algorithm. GE(A[0..n 1, 0..nj) //input: An n x n matrix A[0..n-1, 0..n-11 of real numbers for 1 0 to n 2 for j i 1 to n 1 do for k i to n do Ali, Ali, kJ- Ali, KJ 'Ali, Ali, (25 points) 2. Consider the following well-known sorting algorithm with a counter inserted to count the number of key comparisons. Is the comparison counter inserted in the right place? If you believe it is, prove it, if you believe it is not, make an appropriate correction ALGORITHM A10..n llInput: An array Aro..n 11 of n orderable elements Output: The total number of key comparisons made count for 1 to n 1 do Alij j i -1 while 20 and Ali do count count 1 AD +11 v return count (23 points)