b consider the chefs and cooking slots with ids ranging from p to q in
Question
(b) Consider the chefs and cooking slots with IDs ranging from p to q inclusive, where p ≤ q.
How many distinct functions for assigning chefs to cooking slots are there, such that every
chef is assigned a cooking slot with an ID that is less than or equal to their ID?