Algorithm 9.3.2 generates all k-subsets of {1..n}. (a) What would be a “minimum change” between two k-subsets? // At least 1 new element must be added and the same number removed. (b) Is...

Algorithm 9.3.2 generates all k-subsets of {1..n}.

(a) What would be a “minimum change” between two k-subsets? // At least 1 new element must be added and the same number removed.

(b) Is Lexicographic-Order a minimum-change list? (A Gray code?)

(c) Is there such a list when k = 2 and

n = 4?