If $A$ is a set with $m$ elements and $B$ a set with $n$ elements, how many functions are there from $A$ to $B$. If $m=n$ how many of them are bijections?

I got $n^m$ for my first answer.

I wasn't sure for the bijection bit is it just $n$?