A multiset is a set with (possibly) repeated elements. A k-multiset is one that contains k elements (counting repetitions). Thus, for example, {1, 2, 3, 1, 1, 1} is a 6-multiset. The k-multisets of an n-set can be ordered lexicographically, by sorting the elements in each multiset in non-decreasing order and storing the result as a list of length k. Develop unranking, ranking, and successor algorithms for the k-multisets of an n-set.