Write a Java program to determine whether a simple connected undirected graph is bipartite or not and also to display the

bi-partition of the vertex set in case the graph is bipartite. The input to your program will be the adjacency matrix of a graph.

Run your program on each of the following two input matrices:

0 0 0 1 1 0

0 0 0 1 1 1

0 0 0 0 1 1

1 1 0 0 0 0

1 1 1 0 0 0

0 1 1 0 0 0

0 1 0 1 0 0

1 0 1 0 0 1

0 1 0 1 0 0

1 0 1 0 1 0

0 0 0 1 0 1

0 1 0 0 1 0