(25 points) Consider the problem of finding the value of the largest element in a list of n numbers. For simplicity, we assume that the list is implemented as an array. What is the input size? What is the basic operation? Please analyse the time efficiency of the following algorithm. (hint: using standard formulas and rules of sum manipulation) ALGORITHM MaxElement(A[0..n 1]) //Determines the value of the largest element in a given array //Input: An array A[O..n 1] of real numbers //Output: The value of the largest element in A maxval + A[O] for i = 1 to n - 1 do if A[i]> maxval maxval + - A[i] return maxval