Now you should find a sequence of neighbor transpositions of letters that transform the sequence MARINE (letters are numbered 0..5) to the sequence AIRMEN. Transpositions are represented by pairs of integers. For example, the pair (0,1) transforms MARINE to AMRINE. Transpositions are performed from left to right. You should define the sequence as shown:

def sequence():

return [(...,...), (...,...),...,(...,...)]

(Just replace the dots in the parentheses by pairs of numbers that say which neighbor letters should be replaced. Yes, the format is strange, but this is how python codeblock works...)

[IT IS MISSING IN THE WEEK 6 FOLDER, I HOPE IT WILL BE UPDATED SOON]
[OTHER SLIDES IN WEEK 6 ARE ALSO MISSING]