2 Graph Classes The following are four classes of simple undirected graphs with at lenust 3 vertices. (Each class contains one or more graphs for each value of n (where n 2 3)) For each class, which one of these three statements is true? (A) All the members of the class are bipartite graphs. (B) No member of the class is a bipartite graph. (C) Some members are bipartite graphs and some are not bipartite graphs For the first two options you need to provide a brief explamation/argument for why this is true. For the third option you need to provide two examples, one bipartite and one not. 1. Complete graphs. 2. Trees 3. Cycles. 4. Paths