1. Suppose that we are looking for a stable matching between three job-seekers (Alex, Bailey, and Charlie) and three jobs (at Facebook, Google, and Microsoft). We will use the Gale Shapley algorithm in which each open position makes an offer to the best remaining candidate and each candidate accepts any offer that they prefer over their previous offers (possibly making a previous position become open again). Find a system of preferences for the job-seekers and jobs with the property that, using this algorithm, none of the jobs will be filled by its first-place job-seeker. (You may use initials rather than full names to specify the preferences.)