Problem
1. Construct a set of preference lists for N = 4 for the stable marriage problem Where everyone gets his second choice, or prove that no such set exists.
2. Give a stable configuration for the stable marriage problem for the case where the preference lists for men and women are all the same: in ascending order.
3. Run the stable marriage program for N = 50, using random permutations for preference lists. About how many proposals are made during the execution of the algorithm?