1. Show by example that if A and B are two matchings (not necessarily stable), then A ∨w B is not necessarily a matching.
2. Prove that when the partial ordering over the set of stable matchings is , the minimum of the stable matchings A and B is A ∨m B.