A delivery app gives each of five orders to exactly one of seven riders. Writing O={O1,O2,O3,O4,O5} for the orders and D={D1,D2,…,D7} for the riders, one morning's assignment is the function f:O→D given by
f={(O1,D3),(O2,D5),(O3,D3),(O4,D1),(O5,D5)}
How many riders receive at least one order, how many riders receive exactly two orders, and is f onto?