Do you know how i can solve the problen using python code?

Given is a list with numbers $1$ to n in some order. Sort the list using two commands:

SWAP: swap the first two numbers in the list.

MOVE: move the first number in the list to the last position.

Design an algorithm that forms a list of commands that, when executed, sorts the list. The algorithm can provide any solution as long as it contains at most n$^3$ commands.

Each command should be a string "SWAP" or "MOVE".

Python code

def solve$($t$)$:

# TODO

if $\_\_$name$\_\_=="\_\_$main$\_\_"$:

print$($solve$([1,2]))$ # For example, $[]$

print$($solve$([2,1]))$ # For example, $[$SWAP$]$

print$($solve$([1,3,2]))$ # For example, $[$SWAP$,$ MOVE$]$

print$($solve$([3,2,1]))$ # For example, $[$MOVE$,$ SWAP$]$

print$($solve$([2,3,4,1]))$ # For example, $[$MOVE$,$ MOVE, MOVE$]$

Explanation: The list $[1,3,2]$ can be sorted by first executing the SWAP command, making the list $[3,1,2],$ and then executing the MOVE command, resulting in the list $[1,2,3].$

NB:

print$($solve$([1,5,2,10,4,8,7,3,6,9]))$

Expected output:

a valid list of moves