Which Rules Actually Hold

You are given start and finish times for n classes and want the largest set of classes that pairwise do not overlap. Each proposed algorithm below has the same shape: pick one class by the stated rule, throw away every class that conflicts with it, and recurse on what is left. Ties are broken by an adversary you do not control.

Which of these rules always return a maximum-size schedule? More than one is correct.