Write, in C#, Python, or Ruby, an iterator that yields (a) all permutations of the integers 1 . . n, (b) all combinations of k integers from the range 1 . . n (0 ≤ k ≤ n).

You may represent your permutations and combinations using either a list or an array.