If n objects are distributed over m places, and n < m, then some of the places receive:
(a) at least 2 objects
(b) at most 2 objects
(c) no object
(d) none of the mentioned
The question was asked during an online interview.
My enquiry is from Applications of Pumping Lemma/Pigeonhole principle topic in division Properties of Regular Languages of Automata Theory