Problem 1 (25 points). In the Gale-Shapley algorithm and for N > 1, does there exist a set of preference lists for N hospitals and N residents and an execution of the algorithm) such that every hospital ends up with its least-preferred resident? Give an example or prove it is not possible