we are asked to solve a problem in discrete mathematics and we must complete it within 2 days.. can you help me with it? The problem is:

Using a computational program you have written do the exercise...

Calculate the number of onto functions from a set S to a set T, where S and T are finite sets of various sizes. Can you determine a formula for the number of such functions?

and also can u suggest a program I can use to simulate this problem? i'm thinking of visual basic or C++ but cant start because I cant simply find a formula to fit for the problem..

We are also asked to solve two more problems, and I found them easy and finished them but I cant seem to understand this one.. hope you can help me.. thank you