Hey guys. I need some help solving this proof using induction: Prove that for all non-empty finite sets A and B, there are |B|^|A| functions from A to B (where |B| and |A| obviously represents the cardinality of B and A respectively.) Thanks in advance for the help, since I am pretty stuck. Thanks again! Jeff EDIT: Sorry, to reiterate...these are the practice problems we were told to look at before the test...so it's not HW.