Recall that the bubble sort algorithm is given as follows:

def BubbleSort$($A$)$:

for $i$ in range$($len$($A$)-1)$:

for $j$ in range$($len $(A)-i-1$ :

if $A[j]>A[j+1]$ :

$A[j],A[j+1]=A[j+1],A[j]$

return $A$

Write down each list obtained when the following list is received is input:

$2,5,4,1,3$

Do not write the original list received as input, do not write the same list more than once, and do not include any spaces in your answer.