solve

5. Suppose Justin wants to code a modified version of Bubble Sort but he accidentally puts some code in the wrong place. Here is what he writes: for i = 0 to n-2 inclusive swapped = false for j = 0 to n-i-2 inclusive if A [j] A[j+1] swapped = true swap A [j] and A [j+1] end if if swapped == false : exit code end if end for end for Will this code still sort every list properly? Explain. Solution