1. What is the Stable Matching Problem?

2. Briefly explain (if true) or give a counterexample (if false): In every instance of the Stable Matching Problem, there is a stable matching containing a pair (m, w) such that m is ws first choice and w is ms first choice.

3. Briefly explain (if true) or give a counterexample (if false): If, in a stable matching instance, there is a pair (m,w) such that m is ws first choice and w is ms first choice, then m and w are matched to each other in every stable solution