Q.7 Let G,, be a random graph with a vertices {1, . ..,n}, where every pair of vertices is connected by an edge independently with probability pe (0, 1). A set of four vertices (i, j, k, (} is said to form a square if there are exactly 4 edges among them, forming a square. What is the expected number of squares in the random graph G