mplement the Permutation Generator algorithm as discussed in class and found in section $6\mathrm{.}6$ of the book. Note that the algorithm in the book uses $1-$based arrays, whereas Python uses $0-$based, so you will need to put some thought into it$.$ Do not use Python's built in generators, or any other code that is not yours.

Wrap the code in a main function so that your program prompts the user for any integer N between $1$ and $9,$ and prints ALL permutations in lexicographic order for that N$.$

If they enter $2,$ you'd compute and print:

$0110$

If they enter $3,$ you'd compute and print:

$012021102120201210$