Solve by intersection graph Let S be a set of ‘Moumineen’ with six elements and ‘R:=Love’ be a relation on S such that for s, t ε S, sRt iff s loves t. Construct a graph G for (S, R) that has a vertex for each of the elements of S and has an edge connecting the two vertices representing the two elements if these elements are R-related. Hence find the number of edges in G for (S, R) if S has n elements.