Question $2$

$1$ pts

Which of the following statements is not true about the runs of the Gale$-$Shapley algorithm on a given problem instance, with colleges

In different runs, different numbers of offers can be made.

The outcome may be different when students propose.

A college may be matched with their worst preference.

It is possible that a student will switch their choice in one run, but not in another.