Simple Graphs

For this proof, I'm defining simple graphs to be graphs where no loops and no multiple edges are allowed between nodes. Then, I want to show that there are exactly 2^(n(n-1)/2) labelled simple graphs on n vertices. How do I go about doing this? Also, how many of these have exactly m edges? Thanks!