Please answer parts 1-5, with steps when appropriate, Thanks

Consider the following algorithm and answer the questions. (10\%) ALGORITHM X (A[0..n1]) // Input: A contains n real numbers for i0 to n2 do for ji+1 to n1 do if A[j]>A[i] swap A[i] and A[j] 1. What does this algorithm compute? 1 2. What is the input size? 3. What is the basic operation? 4. How many times is the basic operation executed? (Set up a sum, and simplify the sum, to find the function expressing the number of repetitions of the basic operation.) 5. What is the efficiency class of this algorithm