Assignment:
Given a stable matching of n men and n women,
(a) Is it possible to find three pairs such that if the matching among them is changed, each man will be matched to a woman whom he prefers, and each woman will be matched to a man whom she prefers?
(b) Generalize this conclusion to a subset of k pairs, for every 4 ≤ k ≤ n.
Provide complete and step by step solution for the question and show calculations and use formulas.