Question 1 We consider the following problem with three schools, $1, $2 and $3, and four students, 21, 12, i3 and 24. The capacity of each school is 1. Table 1 gives the school's priorities over students, but for each school we have deleted the students that view the school as unacceptable. P PB Psa 12 21 13 12 Table 1: Schools' priorities 1. For each student, give the list of acceptable schools. 2. Is there a preference profile for the students such that, for that profile, there exists a stable matching where i is matched to s? 3. Using your answer from the previous question, which matching(s) can be stable? (for some preference profile of the students that does not change the set of acceptable schools you answered in question 1)