Hi, with the given work I have done so far located below question 4, how do I give an expression in terms of m and n for the number of hash functions that map from a source set of size n to the integers from 0 ....m-1?

4. List all the hash functions, as sets of ordered pairs, from fa, b,e to 10,1). Also, give an expression in terms of m and n for the number of hash functions that map from a source set of size n to the integers from 0..m-1? 15 points]