Question $19$

$5$ pts

$\backslash$table$[[,$Coach,Chaser,Beater,Keeper,Seeker$],[$Alice$,2,4,1,5,3,5,5,2,4,2],[$Bob$,5,3,4,3,3,3,2,3,1,3],[$Chris$,4,2,5,2,3,4,1,5,2,4],[$Dixon$,1,5,2,1,3,2,4,4,5,1],[$Eve$,2,1,4,4,3,1,5,1,1,5]]$

Use the Stable Matching Algorithm to find a position$-$optimal assignment to the Hufflepuff Quidditch team. Which entry does NOT appear in such a stable matching?

a$)(1,3)$

b$)(2,1)$

c$)(2,3)$

d$)(3,4)$

e$)(4,2)$

a$.)$