I posted this problem yesterday but I don't believe he used the Johnson-Trotter Algorithm and his variable names weren't descriptive and he didn't make it print each of the permutations of 1,2,....,n to the screen along with the time required to do so (also printed to the screen). Thanks for your help. Please comment so I can follow!

JES-Untitled File Edit Watcher MediaTools JES Functions Window Layout Help |-Given a positive integer n between 1 and 9, generate the tpermuations of the set (l, 2,3,,) USING the JOHNSON-TROTTER 11 | #ALGORITHM.* 12 #Using ' import time' and 'time. clock()', determine how many seconds 14 ipasses when running this code for n 3, 4, 5, and 6. 15 LOI #Hints : I wrote the following helper functions. You may find this approach useful. Is a given element mobile? Given a permutation with arrows #and a position, return true if the element in that position is 1 tmobile and false if it is not mobile. 20 | #2. Is any element mobile? Given a permutation with arrows, return true if any element is mobile and false if no element is 22 |tmobile. 22 | #3. What is the position of the largest mobile element? Given a 24 tpermutation with arrows, retur ts l#element. 26 #4. What is the next permutation? Given a permutation with arrows, 27 return the next permutation with arrows. 28 import time 30 211#Given a number n from 1 to 9, print each of the permuations of 1, 2, n to the screen. Calculate the time required to do so, and print that time to the screen as well. s def permute (n): 25 26 27 startTime=time. clock ( ) BODY OF python PUNCTION 1 need GOES HERE using |# desriptive variable names and comments ao i can follow endTime= time . clock() print endTime-startTime il |# HELPER FUNCTIONS MAY GO HERE 42