Bubble Sort compares adjacent elements from left to right.
Whenever:
$A[j]>A[j+1]$
the two elements are swapped.
As a result, the larger element keeps moving toward the right.
For example:
$[5,2,4,1,3]$
During the first pass:
$[5,2,4,1,3]$
$\rightarrow [2,5,4,1,3]$
$\rightarrow [2,4,5,1,3]$
$\rightarrow [2,4,1,5,3]$
$\rightarrow [2,4,1,3,5]$
The largest element $5$ reaches the last position.
Therefore, after one complete pass, the largest element is guaranteed to be in its final sorted position.
Answer : B
