I've gotten stuck at the following exercise;

> 
> There are *m* functions from a one-element set to the set {1, 2, …, *m*}.
>  How many functions are there from a two-element set to {1, 2, …, *m*}?
>  From a three-element set? Give a recurrence for the number of *T(n)* of
>  functions from an *n*-element set to {1, 2, …, *m*}. Solve the recurrence.
> 
> 
> 

I'm not sure how to begin solving it?