solve

Consider this tweak of bubble sort: for i = 0 to n-2 inclusive for j = 0 to n-i-2 if A[j ] = A[j+1 ] swap A[j ] and A[j+1] end if end for end for How does this differ from regular bubble sort? O It is unstable. It doesn't actually sort properly. OO It is not in-place. O There is no difference. Multiple Choice 1 point Suppose [4, 3, 2, 3', 2', 1] sorts to [1, 2, 2', 3', 3, 4). What can we say about the sorting algorithm? O It is not in-place. It is unstable. OO It is in-place. O It is stable. Multiple Choice 1 point Your selection sort pseudocode has a bug! Here is your code: for i = 0 to n-2 inclusive minindex = i for j = itl to n-1 inclusive if A[j]