(2) An undirected graph is an ordered pair (V,E) where V is a set and ECP(V), where |e| = 2 for every e E E. The idea is that an edge of an undirected graph does not have an arrow, and so is simply described as a set of two vertices, rather than an ordered pair. Write the (undirected) graph depicted below as an ordered pair of sets. (Use the style of the expression for G in the preceding problem, but remember that the edges are just sets, not ordered pairs. 1 3 5