Consider the following sorting algorithm: examSort (A[1. .n]) for i1 to n for j-1 to n1 if (Aj AIj+1]) then swap (Al,A+1]) end if end for end for end examSort Express the worst-case running time of this algorithm using big-O notation. Make your bounds as tight as possible. Justify your answer by marking up the code above. True/False Questions True False The examSort algorithm is an in-place sorting algorithm True False The examSort algorithm is a stable sorting algorithm. True False The examSort algorithm is a comparison-based sorting algorithm True False A loop invariant for the outer loop in the examSort algorithm is that Al(n-i+2).n] contains the largest values of the array in sorted order