Problem 1a)show me a planar graph G with 6 vertices and 8 edges, such that G is bipartiteb)show me a planar H with 6 vertices and 8 edges such that H is not bipartite Problem 2You are given the degree...

Problem 1a)show me a planar graph G with 6 vertices and 8 edges, such that G is bipartiteb)show me a planar H with 6 vertices and 8 edges such that H is not bipartite
Problem 2You are given the degree sequence 4,4,3,3,2,2,. Find as many non-isomorphic graphs as you can with this degree sequence. Be sure to tell me how you know they are different.Problem 3Prove the following: if a graph G has n vertices and the sum of the vertex degrees of G is strictly greater than 2n, the G must contain at least two different circuits. "Different" means that they are not identical they have at least one edge which is different.