In bubble sort, the maximum element will move to the extreme right side of the list.
Applying Bubble sort in L1- [127,119,223,136,233,134] Take 127 to be the bubble element and compare that with the next element, if the next element is greater than the current element then shift the bubble element, if not then swap two elements.
Pass-1:
127 is greater than 119, So, swapping is required. Swap 127 and 119.
Total swap-1
L1- [119,127,223,136,233,134]
Now, compare 127 with 223, No swapping required.
Compare 223 with 136, and swap them.
Total swap - 2
L1- [119,127,136,223,233,134]
Compare 223 with 233, no swapping is required.
Compare 233 and 134,1 Swapping required as 134 is smaller than 233. Pass 1 ends here.
Total swap -3
L1- [119,127,136,223,134,233]
Pass-2:
Compare 119 with 127, no swap is required.
Compare 127 with 136 no swap is required.
Compare 136 with 223, no swap is required.
Compare 223 with 134 - 1 swap required as 134 is smaller than 223.
Total swap-4
L1- [119,127,136,134,223,233]
Pass-3:
Now, compare 119 with 127, no swap is required.
Compare 127 with 136, no swap is required.
Compare 136 with 134 and 1 swap is required as 134 is smaller than 136.
Total swap - 5
L1- [119,127,134,136,223,233]
Pass-4:
Now compare 119 with 127, no swap is required.
Compare 127 with 134, no swap is required.
So, the list is already sorted.
In total 5 swaps are required to sort the list using bubble sort.
Option 4 will be the answer.