The Hotel Partner Problem is as follows. There are 2n people and n hotel rooms. Each person maintains a preference list of the remaining 2n 1 people. The objective is to assign two people to each room such that the assignment is stable. An assignment is stable if there are no two people assigned to different rooms who prefer each other over their current partners. Give an instance of the Hotel Partner Problem for which there is no stable solution.