# Prove This

algonewbee
Let A and B be finite sets, and let f:A->B be a function. Show that

a)if f is injective, then |A|<=|B|
b)if f is surjective, then |A|>=|B|