Bipartite Graph An undirected graph is called a bipartite graph if its vertices may be colored in two colors in such a way that each edge connects vertices of different colors.

Write a Python code that checks whether a graph is a bipartite graph in O(V+E) time.

Test the code using the following inputs:

Input: The individual graph generated below.

Output: Print "Graph is bipartite" or "Graph is not bipartite".

Hint. After we choose the color of some vertex, the colors of all other vertices of the same component are uniquely determined