What does the following algorithm do? Figure out its best-case running time function and worst-case running time function, and express them using "Big-Oh" notation. Algorithm Unknown (A, n): Input: an array A of n integers Output: ? f+1 j+1 while f = 1 and j < (n-1)do f+0 for i0 ton- (j + 1) do if A[i] > A[i+ 1] swap A[i] and A[i+1] f+1 j (j+1) return A