Bubble Sort in Assembly (MARIE)

Your program will get a positive integer n from the user. The program will then get n
integers from the user and then print them out in numerical order from least to greatest.
This will be done by storing the numbers in a list (this is like our stack and requires using
indirect commands.)
You must sort the list using the bubble sort algorithm (given below in pseudocode.)
function BUBBLESORT(lst)
for i = 0; i < lst.length; i+ = 1 do
for j = 0; j < lst.length −1; j+ = 1 do
if lst[j] > lst[j + 1] then
swap lst[j] and lst[j+1]
end if
end for
end for
end function