Problem 1 (10 points): Let I = ( M W ) be an instance of the stable matching problem. Suppose that the preference lists of all me M are identical, so without loss of generality, mi has the preference list (W1, W2, ..., wn). Show that there is a unique solution to this instance