QUESTION 2

Problem 2 We consider the following matching problem with 4 students (1'1, 2'2, 3'3, and 1'4) and 4 schools (31, .52, 33, and .54). Each school has a capacity equal to 1. Students\" preferences are given by Table 2 and schools' priorities are given by Table 3. In Table 2 some entries are missing: 0 The 2nd and 3rd most preferred schools for 1'2; 0 The lst and 2nd most preferred schools for 3; 1. Complete the students1 preferences in Table 2 such that the DA algorithm with students proposing runs in 7 steps. Your answer should show the proposals and. acceptance/rejection decisions at each step and the nal maching. 2. With the complete preferences calculate the assignment when we run the Boston algo rithrn. Your answer should show the proposals and. acceptance/rejection decisions at each step and the nal maching. 34 34 52 33 53 32 52 5 1 Table 3: Schools1 Priorities