Let n > 3 and let Gn be a graph with vertex set {x1, . . . , Xn} U {91, ... , Yn} and the following edges: {21, 22}, {22, 23},..., {Xn-1, Xn}, {Xn, X1}, {91,Y2}, {Y2, Y3},..., {Yn-1, Yn}, {yn, y}, and {21, y}, {X2, Y2},..., {In, Yn} (a) Draw the graph G3 (b) How many edges are in Gn? (c) How many paths of length 2 are in the graph Gn? (d) For n > 5 how many cycles of length 4 are in the graph Gn