Identify the basic operation of the following algorithm (that takes as input an array A[0... n-1] of n integers) and analyze its worst-case time complexity. [Bonus points: You will get 5 points, if you correctly identify what the algorithm does and justify your answer. No partial credits for wrong answer to the bonus point component of this question] for i = 0 to n-2 do for j = 0 to n - 2 - i do if A[j + 1] < A [j] then Swap( A[j], A[j+1] ) end if end for end for.