Question

using this function

def num_permutation_sequence(n):

these are the test cases

g = num_permutation_sequence(3)
assert (next(g), next(g), g.send(0), next(g), next(g), next(g),g.send(0)) == (1, 3, 4, 12, 24, 24, 120)

Exercise (Challenge) Extend the function num_permutation_sequence(n) so that calling send(o) method causes the generator to increment n instead of k for the next number to generate. i.e., for 0 <k <n, send(O) . Pn,k-1 ? Pnik Pn+1,6 ? Pn+1,5+1 (7) where without labels is the normal transition without calling the send method. Hint: n + 1 Pn+1,6 = Pnik X n - k +1 (8)