A bipartite graph is a graph G=(V,E) whose vertices can be partitioned into two sets(V =V1V2 and V1 V2 = ) such that there are no edges between vertices in the same set (for instance, if u, v V1, then there is no edge between u and v).

(a) Give a linear-time algorithm to determine whether an undirected graph is bipartite.