Suppose that we generate a random graph g = (v, e) on the vertex set v = {1, 2, . . , n} in the following way. for each pair of vertices i, j ∈ v with i < j, we flip a fair coin, and we include the edge i−j in e if and only if the coin comes up heads. how many edges should we expect g to contain? how many cycles of length 3 should we expect g to contain?