12. Prove that any subgraph of a bipartite graph is bipartite.

12b) Identify if each of the following graphs is bipartite or not bipartite. 3 ii)

I want this to be considered as a Advanced Math question pls. . Consider a graph G which is a complete bipartite graph. The graph G is defined as K(3,4), meaning it has two sets of vertices, with 3 vertices in one set and 4 in the other. Every vertex in one set is connected to every vertex in the other set, but there are no connections within a set. Calculate the number of edges in graph G. Also, determine if the graph G contains an Euler path or circuit, and justify your answer.

Show by example that the statement “every planar graph has a vertex with degree less than or equal to 4” is false.